736 search results - page 48 / 148 » A dynamic data structure for approximate range searching |
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
BMCBI
2007
13 years 8 months ago
2007
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...