Sciweavers

2514 search results - page 187 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
16 years 8 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
FQAS
2009
Springer
196views Database» more  FQAS 2009»
15 years 11 months ago
Flexible SPARQL Querying of Web Data Tables Driven by an Ontology
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
Patrice Buche, Juliette Dibie-Barthélemy, H...
IJCV
2006
146views more  IJCV 2006»
15 years 6 months ago
An A Contrario Decision Method for Shape Element Recognition
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
Pablo Musé, Frédéric Sur, Fr&...