Sciweavers

232 search results - page 12 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
ICDE
2008
IEEE
2751views Database» more  ICDE 2008»
16 years 11 months ago
Skyline Query Processing for Incomplete Data
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
JMLR
2010
111views more  JMLR 2010»
14 years 6 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
ICPR
2004
IEEE
16 years 22 days ago
Feature Selection and Gene Clustering from Gene Expression Data
In this article we describe an algorithm for feature selection and gene clustering from high dimensional gene expression data. The method is based on measuring similarity between ...
D. Dutta Majumder, Pabitra Mitra
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 6 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer