7930 search results - page 190 / 1586 » Greedy in Approximation Algorithms |
302
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
148
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
139
click to vote
STOC
2003
ACM
16 years 6 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...
162
click to vote
NIPS
2004
15 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
198
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...