Sciweavers

2487 search results - page 310 / 498
» Partitions of Graphs into Trees
Sort
View
117
Voted
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
15 years 7 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
115
Voted
ACL
2008
15 years 5 months ago
Efficient Processing of Underspecified Discourse Representations
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
Michaela Regneri, Markus Egg, Alexander Koller
113
Voted
DAGSTUHL
2008
15 years 5 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky
111
Voted
ACL
2006
15 years 5 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
139
Voted
UAI
2001
15 years 4 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....