511 search results - page 3 / 103 » Lower bounds for distributed markov chain problems |
COCOON
2009
Springer
13 years 12 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
SPAA
2010
ACM
13 years 5 months ago
2010
ACM
CVPR
2009
IEEE
14 years 3 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...