Sciweavers

807 search results - page 8 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
NLP
2000
15 years 1 months ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...
AAAI
1998
14 years 11 months ago
Tree Based Discretization for Continuous State Space Reinforcement Learning
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
William T. B. Uther, Manuela M. Veloso
105
Voted
CADE
2005
Springer
15 years 9 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
SODA
2000
ACM
83views Algorithms» more  SODA 2000»
14 years 11 months ago
Restructuring ordered binary trees
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
William S. Evans, David G. Kirkpatrick
ICCV
2009
IEEE
14 years 7 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...