1331 search results - page 8 / 267 » Complexity bounds for zero-test algorithms |
121
click to vote
CORR
2011
Springer
15 years 23 days ago
2011
Springer
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
142
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
152
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
168
click to vote
COLT
2007
Springer
16 years 1 days ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
203
click to vote
DISOPT
2011
15 years 25 days ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...