14403 search results - page 459 / 2881 » Dynamical Systems Trees |
185
click to vote
ENTCS
2010
15 years 7 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 ...
168
click to vote
COMBINATORICS
2004
15 years 6 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...
144
click to vote
ENTCS
2002
15 years 6 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...
205
click to vote
NAACL
2010
15 years 4 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...
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...