Results 1  10
of
2,307,047
Worstcase Optimal Join Algorithms
 PODS'12
, 2012
"... Efficient join processing is one of the most fundamental and wellstudied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worstcase data complexity. Our result b ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Efficient join processing is one of the most fundamental and wellstudied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worstcase data complexity. Our result
Improving WorstCase Optimal Delaunay Triangulation Algorithms
 In 4th Canadian Conference on Computational Geometry
, 1992
"... We present results of an empirical investigation into the performance of two O(nlogn) worstcase optimal Delaunay triangulation algorithms: a divideandconquer algorithm and a planesweep algorithm. We present improvements which give a factor of 45 speedup to the divideandconquer algorithm and a ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We present results of an empirical investigation into the performance of two O(nlogn) worstcase optimal Delaunay triangulation algorithms: a divideandconquer algorithm and a planesweep algorithm. We present improvements which give a factor of 45 speedup to the divideandconquer algorithm and a
WorstCase Optimal Adaptive Prefix Coding
 IN: PROCEEDINGS OF THE ALGORITHMS AND DATA STRUCTURES SYMPOSIUM (WADS
, 2009
"... A common complaint about adaptive prefix coding is that it is much slower than static prefix coding. Karpinski and Nekrich recently took an important step towards resolving this: they gave an adaptive Shannon coding algorithm that encodes each character in O(1) amortized time and decodes it in O(l ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
and decodes each character in O(1) worstcase time. As with both previous adaptive Shannon coders, we store s in at most (H + 1)s  + o(s) bits. We also show that this encoding length is worstcase optimal up to the lower order term.
WORSTCASE OPTIMAL REASONING WITH FOREST LOGIC PROGRAMS
, 2011
"... This report describes a new worstcase optimal tableau algorithm for reasoning with Forest Logic Programs (FoLPs), a decidable fragment of Open Answer Set Programming. FoLPs are a useful device for tight integration of the Description Logic and the Logic Programming worlds: reasoning with the DL SHO ..."
Abstract
 Add to MetaCart
This report describes a new worstcase optimal tableau algorithm for reasoning with Forest Logic Programs (FoLPs), a decidable fragment of Open Answer Set Programming. FoLPs are a useful device for tight integration of the Description Logic and the Logic Programming worlds: reasoning with the DL
WorstCase Optimal and AverageCase Efficient Geometric AdHoc Routing
, 2003
"... In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our simul ..."
Abstract

Cited by 234 (11 self)
 Add to MetaCart
In this paper we present GOAFR, a new geometric adhoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first adhoc algorithm to be both asymptotically optimal and averagecase e#cient. For our
Worstcase optimal redistribution of VCG payments
 In Proceedings of the ACM Conference on Electronic Commerce (EC
, 2007
"... For allocation problems with one or more items, the wellknown VickreyClarkeGroves (VCG) mechanism is efficient, strategyproof, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents ’ payments will sum to more than ..."
Abstract

Cited by 57 (18 self)
 Add to MetaCart
For allocation problems with one or more items, the wellknown VickreyClarkeGroves (VCG) mechanism is efficient, strategyproof, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents ’ payments will sum to more than 0. If there is an auctioneer who is selling the items, this may be desirable, because the surplus payment corresponds to revenue for the auctioneer. However, if the items do not have an owner and the agents are merely interested in allocating the items efficiently among themselves, any surplus payment is undesirable, because it will have to flow out of the system of agents. In 2006, Cavallo [3] proposed a mechanism that redistributes some of the VCG payment back to the agents, while maintaining efficiency, strategyproofness, individual rationality, and the
Worst case optimal unionintersection expression evaluation
 In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP ’05), volume 3580 of Lecture Notes in Computer Science
, 2005
"... addresses: ..."
On the Limitations of Worstcase Optimal Ray Shooting Algorithms
"... This paper examines the lowerbounds of worstcase complexity measures of rayshooting algorithms. It demonstrates that rayshooting requires at least logarithmic time and discusses the strategies how to design such optimal algorithms. It also examines the lowerbounds of storage complexity of logar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper examines the lowerbounds of worstcase complexity measures of rayshooting algorithms. It demonstrates that rayshooting requires at least logarithmic time and discusses the strategies how to design such optimal algorithms. It also examines the lowerbounds of storage complexity
WorstCaseOptimal Anytime Coalition Structure Generation
, 1998
"... Coalition formation is one of the key problems in multiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on finding ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
on finding a worst case bound on how good the optimal coalition structure is compared to the best coalition structure that a nonexhaustive search finds. We show that none of the previous coalition structure generation algorithms can establish any bound because they search fewer nodes than a threshold that we
WorstCaseOptimal Anytime Coalition Structure Generation
"... Coalition formation is one of the key problems in multiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a ..."
Abstract
 Add to MetaCart
a worst case bound on how good the optimal coalition structure is compared to the best coalition structure that a nonexhaustive search nds. We show that none of the previous coalition structure generation algorithms can establish any bound because they search fewer nodes than a threshold that we
Results 1  10
of
2,307,047