209 search results - page 12 / 42 » t-Spanners for metric space searching |
139
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
129
click to vote
TALG
2010
14 years 8 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
153
click to vote
ISM
2006
IEEE
15 years 1 months ago
2006
IEEE
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We propose three distance measures for genetic search space. One is a distance measure in the population space that is useful for understanding the working mechanism of genetic al...
128
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...