Sciweavers

1888 search results - page 274 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
DAWAK
2005
Springer
14 years 2 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
14 years 28 days ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...
SEBD
2000
112views Database» more  SEBD 2000»
13 years 10 months ago
Correct and efficient evaluation of region-based image search
Abstract. Content-based image retrieval systems allow the user to interactively search image databases looking for those images which are similar to a specified query image. To thi...
Ilaria Bartolini, Marco Patella
BIOINFORMATICS
2011
13 years 24 days ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 10 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk