95 search results - page 1 / 19 » Efficient Clustering with Limited Distance Information |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
KDD
2000
ACM
13 years 8 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
IJAHUC
2006
13 years 4 months ago
2006
: Wireless sensor networks require energy efficient routing protocols owing to limited resource on the sensor node. In this paper, we develop optimal distance geographic routing (O...
JUCS
2008
13 years 4 months ago
2008
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
SIAMSC
2008
13 years 4 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...