Sciweavers

2713 search results - page 405 / 543
» Parameterized Tree Systems
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
IJLT
2006
85views more  IJLT 2006»
15 years 6 months ago
Job aids and performance support: the convergence of learning and work
: Performance support is happening where we work and live. Under a tree and at a park bench, in a submarine, at a parent-teacher meeting, in a cubicle, or on the manufacturing floo...
Allison Rossett, Lisa Schafer
ISCI
2006
96views more  ISCI 2006»
15 years 6 months ago
A comparison of classification accuracy of four genetic programming-evolved intelligent structures
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
Athanasios Tsakonas
CSL
2007
Springer
15 years 6 months ago
Stochastic and syntactic techniques for predicting phrase breaks
Determining the position of breaks in a sentence is a key task for a text-to-speech (TTS) system. We describe some methods for phrase break prediction in which the whole sentence ...
Ian Read, Stephen Cox