256 search results - page 14 / 52 » Approximation Algorithms for Hamming Clustering Problems |
101
Voted
ICPP
1995
IEEE
15 years 3 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
81
Voted
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
187
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...