Sciweavers

1038 search results - page 33 / 208
» Space-Bounded Query Approximation
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 11 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
15 years 12 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
AAAI
2008
15 years 2 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
CCCG
2008
15 years 1 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
PVLDB
2010
200views more  PVLDB 2010»
14 years 10 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin