Sciweavers

2834 search results - page 207 / 567
» Representing Trees with Constraints
Sort
View
97
Voted
SSPR
2000
Springer
15 years 4 months ago
Lossless Compression of Surfaces Described as Points
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information...
Juan Ramón Rico-Juan, Jorge Calera-Rubio, R...
ESANN
2008
15 years 2 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
111
Voted
UAI
2001
15 years 2 months ago
Graphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
Michael J. Kearns, Michael L. Littman, Satinder P....
105
Voted
JSS
2008
139views more  JSS 2008»
15 years 20 days ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
ACL
2009
14 years 10 months ago
Comparing the Accuracy of CCG and Penn Treebank Parsers
We compare the CCG parser of Clark and Curran (2007) with a state-of-the-art Penn Treebank (PTB) parser. An accuracy comparison is performed by converting the CCG derivations into...
Stephen Clark, James R. Curran