Sciweavers

156 search results - page 13 / 32
» A Content-Addressable Network for Similarity Search in Metri...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
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...
Richard Cole, Lee-Ad Gottlieb
PR
2000
103views more  PR 2000»
13 years 7 months ago
Genetic algorithm-based clustering technique
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...
Ujjwal Maulik, Sanghamitra Bandyopadhyay
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
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...
Marcel R. Ackermann, Johannes Blömer, Christi...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 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