5138 search results - page 506 / 1028 » Randomized Algorithms for 3-SAT |
171
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
321
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
176
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
205
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
164
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...