Sciweavers

776 search results - page 23 / 156
» Distributed Information Regularization on Graphs
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 11 days ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
121
Voted
TIT
2010
107views Education» more  TIT 2010»
14 years 7 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
CORR
2006
Springer
161views Education» more  CORR 2006»
15 years 13 days ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy
88
Voted
CORR
2011
Springer
150views Education» more  CORR 2011»
14 years 7 months ago
Total variation regularization for fMRI-based prediction of behaviour
—While medical imaging typically provides massive amounts of data, the extraction of relevant information for predictive diagnosis remains a difficult challenge. Functional MRI ...
Vincent Michel, Alexandre Gramfort, Gaël Varo...
115
Voted
CONCUR
2006
Springer
15 years 4 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger