Sciweavers

475 search results - page 37 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
BMVC
2001
13 years 11 months ago
Recognition and retrieval via histogram trees
This paper explores a new method for analysing and comparing image histograms. The technique amounts to a novel way of backprojecting an image into one with fewer, statistically s...
Stuart Gibson, Richard Harvey
NIPS
2000
13 years 10 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 3 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
ISMB
1996
13 years 10 months ago
A Knowledge-Based Method for Protein Structure Refinement and Prediction
The native conformation of a protein, in a given environment, is determined entirely by the various interatomic interactions dictated by the amino acid sequence (1-3). We describe...
Shankar Subramaniam, David K. Tcheng, James M. Fen...
DASFAA
2004
IEEE
102views Database» more  DASFAA 2004»
14 years 16 days ago
Efficient Declustering of Non-uniform Multidimensional Data Using Shifted Hilbert Curves
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
Hak-Cheol Kim, Mario A. Lopez, Scott T. Leutenegge...