Sciweavers

1661 search results - page 150 / 333
» Decision Tree Fields
Sort
View
AAMAS
2012
Springer
14 years 2 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
ICCAD
1995
IEEE
129views Hardware» more  ICCAD 1995»
15 years 10 months ago
Activity-driven clock design for low power circuits
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
Gustavo E. Téllez, Amir H. Farrahi, Majid S...
SAC
2002
ACM
15 years 6 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
ICIC
2009
Springer
15 years 4 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
16 years 6 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth