Sciweavers

191 search results - page 21 / 39
» XPath Query Evaluation: Improving Time and Space Efficiency
Sort
View
SIGIR
2008
ACM
13 years 8 months ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
ESWS
2011
Springer
12 years 12 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
CVPR
2007
IEEE
14 years 10 months ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid
DEXA
2003
Springer
162views Database» more  DEXA 2003»
14 years 1 months ago
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
Bonggi Jun, Bonghee Hong, Byunggu Yu
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 9 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount