1331 search results - page 135 / 267 » Complexity bounds for zero-test algorithms |
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
DIALM
2005
ACM
14 years 12 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
CSR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
120
click to vote
SIGECOM
2011
ACM
14 years 23 days ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...