Results 1 - 10 of 1,448

Dense Point Sets Have Sparse Delaunay Triangulations

by Jeff Erickson
"... Delaunay triangulations and Voronoi diagrams are one of the most thoroughly studies objects in computational geometry, with numerous applications including nearest-neighbor searching, clustering, finite-element mesh generation, deformable surface modeling, and surface reconstruction. Many algorithms ..."
Abstract - Cited by 29 (2 self) - Add to MetaCart
algorithms in these application domains begin by constructing the Delaunay triangulation or Voronoi diagram of a set of points in R³. Since three-dimensional Delaunay triangulations can have complexity Ω(n²) in the worst case, these algorithms have worst-case running time \Omega (n2). However, this behavior

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING

by N. Karmarkar - COMBINATORICA , 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract - Cited by 860 (3 self) - Add to MetaCart
We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than

Fibonacci Heaps and Their Uses in Improved Network optimization algorithms

by Michael L. Fredman, Robert Endre Tarjan , 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract - Cited by 739 (18 self) - Add to MetaCart
time and all other standard heap operations in o ( 1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worst-case bounds, where n is the number of vertices and m the number of edges

The Complexity of Decentralized Control of Markov Decision Processes

by Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein - Mathematics of Operations Research , 2000
"... We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fullyobservable case and the partially-observable case that allow for decentralized control are described. ..."
Abstract - Cited by 411 (46 self) - Add to MetaCart
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fullyobservable case and the partially-observable case that allow for decentralized control are described

Self-adjusting binary search trees

by Daniel Dominic Sleator, Robert Endre Tarjan , 1985
"... The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an am ..."
Abstract - Cited by 432 (18 self) - Add to MetaCart
an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access

Worst-Case Analysis of Set Union Algorithms

by Robert E. Tarjan, Jan van Leeuwen , 1984
"... This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression for maintaining a collection of disjoint sets under union. We show that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas ..."
Abstract - Cited by 128 (13 self) - Add to MetaCart
This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression for maintaining a collection of disjoint sets under union. We show that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas

Worst-Case Running Times for Average-Case Algorithms

by Luís Antunes, Lance Fortnow
"... Abstract—Under a standard hardness assumption we exactly characterize the worst-case running time of languages that are in average polynomial-time over all polynomial-time samplable distributions. More precisely we show that if exponential time is not infinitely often in subexponential space, then t ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract—Under a standard hardness assumption we exactly characterize the worst-case running time of languages that are in average polynomial-time over all polynomial-time samplable distributions. More precisely we show that if exponential time is not infinitely often in subexponential space

On Optimal Worst-Case Matching

by Cheng Long, Raymond Chi-wing, Wong Philip, S. Yu, Minhao Jiang
"... Bichromatic reverse nearest neighbor (BRNN) queries have been studied extensively in the literature of spatial databases. Given a set P of service-providers and a set O of customers, a BRNN query is to find which customers in O are “interested ” in a given serviceprovider in P. Recently, it has been ..."
Abstract - Add to MetaCart
to understand but not scalable to large datasets due to its relatively high time/space complexity. Swap-Chain, which follows a fundamentally different idea from Threshold-Adapt, runs faster than Threshold-Adapt by orders of magnitude and uses significantly less memory. We conducted extensive empirical studies

Integrating Multimedia Applications in Hard Real-Time Systems

by Luca Abeni, Giorgio Buttazzo, Scuola Superiore, S. Anna - in Proc. 19th IEEE Real-Time Systems Symposium (RTSS’98 , 1998
"... This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where two types of tasks can coexist simultaneously: multimedia soft real-time tasks and hard real-time tasks. Hard tasks are guaranteed based on worst case execution times and ..."
Abstract - Cited by 318 (51 self) - Add to MetaCart
This paper focuses on the problem of providing efficient run-time support to multimedia applications in a real-time system, where two types of tasks can coexist simultaneously: multimedia soft real-time tasks and hard real-time tasks. Hard tasks are guaranteed based on worst case execution times

The worst-case time complexity for generating all maximal cliques, COCOON

by Etsuji Tomita , Akira Tanaka , Haruhisa Takahashi - Lecture Notes in Computer Science, , 2004
"... Abstract We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time co ..."
Abstract - Cited by 82 (1 self) - Add to MetaCart
Abstract We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time
Results 1 - 10 of 1,448