256 search results - page 31 / 52 » Approximation Algorithms for Hamming Clustering Problems |
GLOBECOM
2007
IEEE
15 years 4 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 ...
EDBT
2004
ACM
15 years 9 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...
74
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
TCS
2010
14 years 8 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
105
click to vote
JMLR
2010
14 years 8 months ago
2010
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...