2600 search results - page 75 / 520 » Clustering with or without the Approximation |
185
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
GRID
2003
Springer
15 years 3 months ago
2003
Springer
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
IPL
1998
14 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we present a novel on-line probabilistic generative model that simultaneously deals with both the clustering and the tracking of an unknown number of moving objects...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...