2713 search results - page 216 / 543 » Parameterized Tree Systems |
130
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
141
click to vote
ENTCS
2010
15 years 4 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
121
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
116
Voted
ENTCS
2002
15 years 3 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
159
click to vote
NAACL
2010
15 years 2 months ago
2010
In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied t...