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...
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....
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...
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 ...