Sciweavers

2638 search results - page 96 / 528
» Random Geometric Complexes
Sort
View
STACS
2005
Springer
15 years 10 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
COMPGEOM
2010
ACM
15 years 8 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
16 years 4 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
PRICAI
2004
Springer
15 years 9 months ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff