Sciweavers

583 search results - page 47 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
ASPDAC
2008
ACM
169views Hardware» more  ASPDAC 2008»
14 years 11 months ago
Buffered clock tree synthesis for 3D ICs under thermal variations
In this paper, we study the buffered clock tree synthesis problem under thermal variations for 3D IC technology. Our major contribution is the Balanced Skew Theorem, which provides...
Jacob R. Minz, Xin Zhao, Sung Kyu Lim
ICS
2010
Tsinghua U.
15 years 7 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
EDBT
2008
ACM
154views Database» more  EDBT 2008»
15 years 10 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
IDA
2007
Springer
15 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 9 months ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...