3020 search results - page 25 / 604 » Optimal partition trees |
102
click to vote
PAAPP
2006
15 years 3 months ago
2006
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
92
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
106
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
135
Voted
ARSCOM
2007
15 years 3 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
135
Voted
ICCAD
2006
IEEE
16 years 13 days ago
2006
IEEE
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...