Sciweavers

2215 search results - page 170 / 443
» Wide open spaces
Sort
View
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
16 years 6 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
ICDE
2001
IEEE
180views Database» more  ICDE 2001»
16 years 6 months ago
Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information
Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However, recent research results in the database ...
Norio Katayama, Shin'ichi Satoh
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
15 years 11 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
FQAS
2009
Springer
129views Database» more  FQAS 2009»
15 years 11 months ago
Representing Context Information for Document Retrieval
The bag of words representation (BoW), which is widely used in information retrieval (IR), represents documents and queries as word lists that do not express anything about context...
Maya Carrillo, Esaú Villatoro-Tello, Aureli...
ICPP
2008
IEEE
15 years 11 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu