Sciweavers

5699 search results - page 81 / 1140
» Alternating model trees
Sort
View
CSR
2007
Springer
15 years 10 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
CP
2000
Springer
15 years 7 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 4 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
BMCBI
2011
14 years 11 months ago
Tree Pruner: An efficient tool for selecting data from a biased genetic database
Background: Large databases of genetic data are often biased in their representation. Thus, selection of genetic data with desired properties, such as evolutionary representation ...
Mohan Krishnamoorthy, Pragneshkumar Patel, Mira Di...
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
15 years 10 months ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz