16430 search results - page 428 / 3286 » On Computable Tree Functions |
179
click to vote
QUESTA
2010
15 years 5 months ago
2010
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
198
click to vote
EMNLP
2010
15 years 4 months ago
2010
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
194
click to vote
SIGDIAL
2010
15 years 4 months ago
2010
We introduce a novel approach for robust belief tracking of user intention within a spoken dialog system. The space of user intentions is modeled by a probabilistic extension of t...
205
Voted
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
185
click to vote
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— Backpropagation through time is a very popular discrete-time recurrent neural network training algorithm. However, the computational time associated with the learning process t...