218 search results - page 13 / 44 » Finite Trees as Ordinals |
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
FUIN
2008
14 years 9 months ago
2008
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
PAAPP
2006
14 years 9 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...
128
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...