231 search results - page 2 / 47 » Sublinear time approximate clustering |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
CORR
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...