5595 search results - page 59 / 1119 » Approximation Algorithms for Clustering Problems |
116
Voted
SODA
2000
ACM
15 years 5 months ago
2000
ACM
152
Voted
ICPP
2002
IEEE
15 years 9 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
145
click to vote
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
131
click to vote
CCCG
2006
15 years 6 months ago
2006
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
139
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...