Sciweavers

4095 search results - page 66 / 819
» How to test a tree
Sort
View
SIGCSE
1996
ACM
136views Education» more  SIGCSE 1996»
15 years 2 months ago
Thinking about binary trees in an object-oriented world
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
A. Michael Berman, Robert C. Duvall
AAAI
1990
14 years 11 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
ACL
2011
14 years 1 months ago
Using Derivation Trees for Treebank Error Detection
This work introduces a new approach to checking treebank consistency. Derivation trees based on a variant of Tree Adjoining Grammar are used to compare the annotation of word sequ...
Seth Kulick, Ann Bies, Justin Mott
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
15 years 4 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
ADAEUROPE
2004
Springer
15 years 3 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...