486 search results - page 47 / 98 » Improved upper bounds for 3-SAT |
ISAAC
2005
Springer
15 years 3 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 ,...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
UAI
2004
14 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
ALGORITHMICA
2000
14 years 9 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
107
click to vote
SIGMOD
2012
ACM
13 years 5 days ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...