Sciweavers

3455 search results - page 476 / 691
» Generalized Game Trees
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Nearest Neighbor Ensemble
Recent empirical work has shown that combining predictors can lead to significant reduction in generalization error. The individual predictors (weak learners) can be very simple, ...
Bojun Yan, Carlotta Domeniconi
DAC
2007
ACM
16 years 7 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
DAC
2003
ACM
16 years 7 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden
ICML
2008
IEEE
16 years 7 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ICML
2006
IEEE
16 years 7 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty