363 search results - page 64 / 73 » Partial Multicuts in Trees |
109
Voted
ACL
1993
15 years 3 months ago
1993
This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses fo...
107
Voted
AI
2008
Springer
15 years 2 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
128
click to vote
CGF
2008
15 years 2 months ago
2008
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistan...
130
Voted
CORR
2008
Springer
15 years 1 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...
127
Voted
EJC
2008
15 years 1 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...