Sciweavers

105 search results - page 4 / 21
» Representing Trees of Higher Degree
Sort
View
84
Voted
IIS
2001
15 years 1 months ago
The Development of the AQ20 Learning System and Initial Experiments
: Research on a new system implementing the AQ learning methodology, called AQ20, is briefly described, and illustrated by initial results from an experimental version. Like its pr...
Guido Cervone, Liviu Panait, Ryszard S. Michalski
ICALP
2007
Springer
15 years 5 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
73
Voted
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 3 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman
ACL
2006
15 years 1 months ago
Learning Accurate, Compact, and Interpretable Tree Annotation
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
Slav Petrov, Leon Barrett, Romain Thibaux, Dan Kle...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...