5138 search results - page 933 / 1028 » Randomized Algorithms for 3-SAT |
125
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
195
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a layer-2 protocol for wireless local area networks (WLANs), it is of increasing interes...
141
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
134
click to vote
ISCA
2005
IEEE
15 years 7 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
130
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...