118 search results - page 24 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
WWW
2005
ACM
14 years 6 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
CIBCB
2006
IEEE
13 years 11 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...