Sciweavers

921 search results - page 7 / 185
» A Markov Network Based Factorized Distribution Algorithm for...
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
AAAI
1997
13 years 8 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
ICC
2009
IEEE
114views Communications» more  ICC 2009»
14 years 2 months ago
Distributed Gradient Based Gain Allocation for Coherent Multiuser AF Relaying Networks
—A set of distributed non-cooperating relay antennas is known to be capable of orthogonalizing multiple sourcedestination pairs in space by coherent amplify-and-forward (AF) rela...
Celal Esli, Jörg Wagner, Armin Wittneben
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid