Sciweavers

507 search results - page 28 / 102
» Sizes of Ordered Decision Trees
Sort
View
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
13 years 8 months ago
Destruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
James Allen Fill, Nevin Kapur, Alois Panholzer
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 7 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
ACL
1997
13 years 9 months ago
Learning Features that Predict Cue Usage
Our goal is to identify the features that predict the occurrence and placement of discourse cues in tutorial explanations in order to aid in the automatic generation of explanatio...
Barbara Di Eugenio, Johanna D. Moore, Massimo Paol...
PLANX
2007
13 years 9 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
ICIP
2005
IEEE
14 years 9 months ago
Learning to binarize document images using a decision cascade
In this article, we propose a special type of decision tree, called a decision cascade, for binarizing document images. Such images are produced by cameras, resulting in varying de...
Chien-Hsing Chou, Chih-Ching Huang, Wen-Hsiung Lin...