5595 search results - page 330 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
ISPAN
2005
IEEE
16 years 9 days ago
2005
IEEE
In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, ...
210
click to vote
PRIS
2004
15 years 8 months ago
2004
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...
216
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
158
click to vote
SPIRE
2005
Springer
16 years 5 days ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
155
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...