—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...
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...
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...
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...
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...