2475 search results - page 136 / 495 » On the accuracy of language trees |
179
click to vote
CC
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
142
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
159
click to vote
PLANX
2008
15 years 7 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
188
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
175
click to vote
ALT
2010
Springer
15 years 3 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...