Sciweavers

1480 search results - page 22 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ICDM
2007
IEEE
173views Data Mining» more  ICDM 2007»
14 years 1 months ago
Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
Ramesh Nallapati, Amr Ahmed, William W. Cohen, Eri...
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 9 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
IPSN
2005
Springer
14 years 1 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
IPPS
2010
IEEE
13 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke