Sciweavers

5699 search results - page 171 / 1140
» Alternating model trees
Sort
View
ACL
2011
14 years 8 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
AMW
2011
14 years 8 months ago
A Direct Translation from XPath to Nondeterministic Automata
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
Nadime Francis, Claire David, Leonid Libkin
JDCTA
2010
151views more  JDCTA 2010»
14 years 11 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
143
Voted
ICASSP
2011
IEEE
14 years 8 months ago
A new method for visual stylometry on impressionist paintings
A new emerging field, that of visual stylometry of art, proposes to apply image analysis and machine learning tools to high-resolution digital images of artwork in order to assis...
Hanchao Qi, Shannon Hughes
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 9 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang