121 search results - page 16 / 25 » Algorithms for optimal dyadic decision trees |
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
MMB
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...