1060 search results - page 6 / 212 » On the Discovery of Random Trees |
TALG
2008
14 years 9 months ago
2008
CPC
2008
14 years 10 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
COLT
2003
Springer
15 years 3 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...