Sciweavers

2200 search results - page 188 / 440
» Bloch's Constant is Computable
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
16 years 7 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
16 years 7 months ago
On Buffering Schemes for Long Multi-Layer Nets
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...
Vani Prasad, Madhav P. Desai
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 6 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson