Sciweavers

1244 search results - page 10 / 249
» Searching in Higher Dimension
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
WWW
2004
ACM
14 years 9 months ago
On the temporal dimension of search
Philip S. Yu, Xin Li, Bing Liu
IEEEICCI
2005
IEEE
14 years 2 months ago
How to disregard irrelevant stimulus dimensions: evidence from comparative visual search
To what extent is it possible to disregard stimulus dimensions that are irrelevant to a certain task? This question was tackled in three experiments using the paradigm of comparat...
Marc Pomplun, E. Carbone, Lorenz Sichelschmidt, B....
DASFAA
2009
IEEE
135views Database» more  DASFAA 2009»
14 years 14 days ago
Dimension-Specific Search for Multimedia Retrieval
Observing that current Global Similarity Measures (GSM) which average the effect of few significant differences on all dimensions may cause possible performance limitation, we prop...
Zi Huang, Heng Tao Shen, Dawei Song, Xue Li, Stefa...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 25 days ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani