Sciweavers

685 search results - page 7 / 137
» Succinct Trees in Practice
Sort
View
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 2 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen
ADC
2003
Springer
115views Database» more  ADC 2003»
13 years 11 months ago
Document Classification via Structure Synopses
Information available in the Internet is frequently supplied simply as plain ascii text, structured according to orthographic and semantic conventions. Traditional document classi...
Liping Ma, John Shepherd, Anh Nguyen
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 1 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
ICML
1990
IEEE
13 years 11 months ago
An Incremental Method for Finding Multivariate Splits for Decision Trees
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
Paul E. Utgoff, Carla E. Brodley
EACL
2006
ACL Anthology
13 years 9 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti