Sciweavers

1813 search results - page 10 / 363
» Calculi of Approximation Spaces
Sort
View
ICALP
2005
Springer
15 years 5 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
CVPR
1997
IEEE
16 years 1 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
ATAL
2007
Springer
15 years 5 months ago
Approximate state estimation in multiagent settings with continuous or large discrete state spaces
We present a new method for carrying out state estimation in multiagent settings that are characterized by continuous or large discrete state spaces. State estimation in multiagen...
Prashant Doshi
FOCS
1999
IEEE
15 years 4 months ago
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
Piotr Indyk
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 1 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu