507 search results - page 26 / 102 » Sizes of Ordered Decision Trees |
103
click to vote
SIAMCOMP
2000
15 years 7 days ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
102
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
101
click to vote
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
119
Voted
JMLR
2010
14 years 11 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
81
Voted
ISMVL
2003
IEEE
15 years 5 months ago
2003
IEEE
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent var...