2924 search results - page 17 / 585 » Lower Bounds in Distributed Computing |
AAAI
2008
15 years 8 days ago
2008
JC
2006
14 years 10 months ago
2006
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
ICONIP
2004
14 years 11 months ago
2004
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...