5100 search results - page 197 / 1020 » The Linear Complexity of a Graph |
120
click to vote
EMNLP
2008
15 years 4 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
118
click to vote
AIPS
2009
15 years 4 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
116
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
129
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
130
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...