Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
Message-passing in stochastic processing networks (2011)
Cached
Download Links
[web.mit.edu]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Devavrat Shah
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
5126
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Geman, Geman - 1984
1945
Rate control for communication networks: Shadow prices, proportional fairness and stability,
- Kelly, Maulloo, et al. - 1998
1589
Graphical Models,
- Lauritzen - 1996
1415
Integer and Combinatorial Optimization,
- Nemhauser, Wolsey - 1999
1366
Low-density parity-check codes,”
- Gallager - 1962
1000
Tsitsiklis, Parallel and Distributed Computation,
- Bertsekas, N - 1989
949
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks.
- Tassiulas, Ephremides - 1992
857
Markov chain Monte Carlo in practice.
- Gilks, Richardson, et al. - 1996
819
Graphical models, exponential families, and variational inference. Foundations and Trends R©
- Wainwright, Jordan - 2008
751
Dynamic Programming and Optimal Control. Athena Scientific,
- Bertsekas - 2007
676
Fair end-to-end window-based congestion control,”
- Mo, Walrand - 2000
527
Achieving 100% Throughput in an Input-Queued Switch,”
- Mckeown, Mekkittikul, et al. - 1999
444
Modern coding theory,
- Richardson, Urbanke - 2008
438
The Mathematics of Internet Congestion Control.
- Srikant - 2004
298
Statistical Field Theory.
- Parisi - 1987
292
Spin Glass Theory and Beyond, World Scientific Publications,
- Mezard, Parisi - 1986
225
A New Class of Upper Bounds on the Log Partition Function”,
- Wainwright, Jaakkola, et al. - 2005
220
Impact of fairness on internet performance,”
- Bonald, Massoulie - 2001
214
Bandwidth sharing and admission control for elastic traffic,” in:
- Roberts, Massoulie - 1998
202
Computational molecular biology: an algorithmic approach.
- Pevzner - 2000
196
Analytic and algorithmic solution of random satisfiability problems,
- Mezard, Parisi, et al. - 2002
194
Blocking probabilities in large circuit-switched networks,”
- Kelly - 1986
181
A distributed CSMA algorithm for throughput and utility maximization in wireless networks.
- Jiang, Walrand - 2010
162
Loss networks,”
- Kelly - 1991
157
Message-passing algorithms for compressed sensing.
- Donoho, Maleki, et al. - 2009
140
On the convergence of the coordinate descent method for convex differentiable minimization,”
- Luo, Tseng - 1992
119
Stability and performance analysis of networks supporting services with rate control -could the internet be unstable?”
- Veciana, Lee, et al. - 1999
117
Hardness of approximations.
- Arora, Lund - 1997
109
Auction algorithms for network flow problems: A tutorial introduction,”
- Bertsekas - 1992
103
Gibbs measures and phase transitions,
- Georgii - 2011
103
Loopy belief propagation and Gibbs measures.
- Tatikonda, Jordan - 2002
98
The complexity of computing the permanent, Theoretical computer science 8
- Valiant - 1979
79
Statistical theory of superlattices
- Bethe - 1935
72
Solving Convex Programs by Random Walks,”
- Bertsimas, Vempala - 2004
71
Maximum pressure policies in stochastic processing networks.
- Dai, Lin - 2005
66
Network optimization and control,”
- Shakkottai, Srikant - 2008
57
Counter braids: A novel counter architecture for per-flow measurement,” in
- Lu, Montanari, et al. - 2008
53
Max-product for maximum weight matching: Convergence, correctness, and LP duality
- Bayati, Shah, et al. - 2008
47
Simple deterministic approximation algorithms for counting matchings
- BAYATI, GAMARNIK, et al.
46
An introduction to causal inference.
- Pearl - 2010
46
Gossip algorithms”, Foundations and Trends
- Shah - 2008
43
Asymptotic optimality of maximum pressure policies in stochastic processing networks.
- Dai, Lin - 2008
43
Distributed random access algorithm: Scheduling and congestion control,”
- Jiang, Shah, et al. - 2010
38
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method.
- Gamarnik, Nowicki, et al. - 2006
33
Simulated annealing for convex optimization
- Kalai, Vempala
32
Interpretation and Analysis of Gaussian Belief Propagation
- Johnson
30
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
- Gamarnik, Katz
28
Randomized scheduling algorithm for queueing networks.
- Shah, Shin - 2012
24
Resource allocation and cross layer control in wireless networks
- Georgiadis, Neely, et al.
20
Logconcave functions: Geometry and efficient sampling algorithms.
- Lovasz, Vempala - 2003
18
Fluid limits for networks with bandwidth sharing and general document size distributions.
- Gromoll, Williams - 2009
17
Belief Propagation for Min-cost Network Flow: Convergence and Correctness,
- Gamarnik, Shah, et al. - 2010
16
On the exactness of the cavity method for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs
- Bayati, Borgs, et al.
15
Network adiabatic theorem: An efficient randomized protocol for contention resolution
- Shin, Shah, et al. - 2009
14
The throughput of switches with and without speed-up.
- Dai, Prabhakar - 2000
14
Convergence of the min-sum algorithm for convex optimization
- Moallemi, Roy - 2007
12
Iterative scheduling algorithms
- Bayati, Prabhakar, et al. - 2007
12
Local rules for global MAP: When do they work
- Jung, Kohli, et al. - 2009
12
Belief propagation: an asymptotically optimal algorithm for the random assignment problem.
- Salez, Shah - 2009
11
Convergence of min-sum message passing for quadratic optimization
- Moallemi, Roy - 2009
11
Network Flows and Monotropic Optimization. Athena Scientific,
- Rockafellar - 1998
9
A proof of the queueing formula L= λ W
- Little - 1961
9
Exact MAP estimates via agreement on (hyper)trees: Linear programming and message-passing,
- Wainwright, Jaakkola, et al. - 2005
8
A simple message-passing algorithm for compressed sensing
- Chandar, Shah, et al. - 2010
7
Convergent and correct message passing schemes for optimization problems over graphical models. Arxiv preprint arXiv:1002.3239,
- Ruozzi, Tatikonda - 2010
6
Revisiting stochastic loss networks: structures and algorithms
- Jung, Lu, et al. - 2008
6
Delay Optimal Queue-based CSMA
- Shah, Shin - 2010
4
Counting down the tree
- Weitz - 2006
2
Analyzing product-form stochastic networks via factor graphs and the sum-product algorithm
- Ni, Tatikonda
2
Belief propagation and LP relxation for weighted matching in general graphs
- Sanghavi, Malioutov, et al.
1
Counting without sampling: new algorithmsforenumerationproblemsusingstatisticalphysics.In
- Bandyopadhyay, Gamarnik - 2006
1
A random polynomial-time algorithm forapproximatingthevolumeofconvexbodies.JournaloftheACM(JACM
- Dyer, Frieze, et al. - 1991
1
Average-case complexity of Maximum Weight Independent Set with random weights in bounded degree graphs
- Gamarnik, Goldberg, et al. - 2010
1
Message-passing for wireless scheduling: an experimental study
- Giaccone, Shah - 2010
1
2004.Fluidmodelforanetworkoperatingundera fair bandwidth-sharing policy
- Kelly, Williams
1
Network Scheduling and Message-passing. Performance Modeling and Engineering
- Shah - 2008
1
Hardness of low delay scheduling
- Tse, C, et al. - 2009