20 search results - page 4 / 4 » Approximate Query Processing on High Dimensionality Database... |
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
CIDM
2007
IEEE
13 years 10 months ago
2007
IEEE
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Recognizing the location and orientation of a mobile device from captured images is a promising application of image retrieval algorithms. Matching the query images to an existing...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...