982 citations · 2.8k across the 131 of their papers we have counts for
6 papers · 1 filter
On the Delay Scaling Laws of Cache Networks
Boram Jin, Se-Young Yun, Deawoo Kim +5
The Internet is becoming more and more content-oriented, where one of main components in content-oriented Internet architectures is network caching. Despite a surge of extensive us…
CSMA over Time-varying Channels: Optimality, Uniqueness and Limited Backoff Rate
Se-Young Yun, Jinwoo Shin, Yung Yi
Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) algo- rithms can be throughput optimal for arbitrary wireless network topology. However, these…
Loop Calculus and Bootstrap-Belief Propagation for Perfect Matchings on Arbitrary Graphs
Michael Chertkov, Andrew Gelfand, Jinwoo Shin
This manuscript discusses computation of the Partition Function (PF) and the Minimum Weight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem…
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles
Sungsoo Ahn, Michael Chertkov, Andrew E. Gelfand +2
We study the Maximum Weight Matching (MWM) problem for general graphs through the max-product Belief Propagation (BP) and related Linear Programming (LP). The BP approach provides…
CSMA using the Bethe Approximation: Scheduling and Utility Maximization
Se-Young Yun, Jinwoo Shin, Yung Yi
CSMA (Carrier Sense Multiple Access), which resolves contentions over wireless networks in a fully distributed fashion, has recently gained a lot of attentions since it has been pr…
Belief Propagation for Linear Programming
Andrew Gelfand, Jinwoo Shin, Michael Chertkov
Belief Propagation (BP) is a popular, distributed heuristic for performing MAP computations in Graphical Models. BP can be interpreted, from a variational perspective, as minimizin…