2924 search results - page 17 / 585 » Lower Bounds in Distributed Computing |
AAAI
2008
13 years 10 months ago
2008
JC
2006
13 years 7 months ago
2006
STACS
2009
Springer
14 years 2 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
14 years 16 days 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
13 years 9 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...