50 search results - page 8 / 10 » Universal Succinct Representations of Trees |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
IJCAI
2007
13 years 9 months ago
2007
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...