Sciweavers

1105 search results - page 141 / 221
» Approximate Spectral Clustering.
Sort
View
GLOBECOM
2007
IEEE
14 years 4 months ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
14 years 4 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
ECML
2006
Springer
14 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 11 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
ISCAPDCS
2004
13 years 11 months ago
FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
Thomas H. Cormen, Elena Riccio Davidson