Sciweavers

209 search results - page 21 / 42
» t-Spanners for metric space searching
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
15 years 6 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 1 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
CIKM
2008
Springer
15 years 2 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
CVPR
2003
IEEE
16 years 2 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 1 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis