1060 search results - page 53 / 212 » On the Discovery of Random Trees |
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
ACL
2000
14 years 11 months ago
2000
This paper reports the first part of a project that aims to develop a knowledge extraction and knowledge discovery system that extracts causal knowledge from textual databases. In...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
CPC
2004
14 years 10 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
BMCBI
2010
14 years 10 months ago
2010
We study the shape of coverage functions resulting from the sequencing of random genome fragments, and show that they can be described by Galton-Watson trees. This extends standar...