Sciweavers

5153 search results - page 67 / 1031
» Introduction to Randomized Algorithms
Sort
View
JMLR
2012
13 years 7 days ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 11 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
STOC
2007
ACM
110views Algorithms» more  STOC 2007»
15 years 10 months ago
Randomly coloring planar graphs with fewer colors than the maximum degree
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
15 years 10 months ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
15 years 4 months ago
Random Subsets of the Interval and P2P Protocols
Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, ...