Sciweavers

419 search results - page 3 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 3 days ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
VLDB
2001
ACM
129views Database» more  VLDB 2001»
13 years 10 months ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
ICASSP
2008
IEEE
14 years 6 days ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
TKDE
2008
107views more  TKDE 2008»
13 years 5 months ago
Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems
We present a new adaptive and energy-efficient broadcast model to support flexible responses to client queries. Clients do not have to request documents by name, since they may kno...
Wei Wang, Chinya V. Ravishankar
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 7 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...