Sciweavers

7150 search results - page 182 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
SODA
2003
ACM
94views Algorithms» more  SODA 2003»
15 years 7 months ago
Sublinear-time approximation of Euclidean minimum spanning tree
Artur Czumaj, Funda Ergün, Lance Fortnow, Avn...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 6 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 6 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
176
Voted
COMPGEOM
2007
ACM
15 years 10 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
FCT
2003
Springer
15 years 11 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith