Sciweavers

656 search results - page 56 / 132
» Marrying Words and Trees
Sort
View
COR
2006
98views more  COR 2006»
15 years 6 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
JCT
2008
103views more  JCT 2008»
15 years 6 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
JSC
2006
95views more  JSC 2006»
15 years 6 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
NAACL
2010
15 years 4 months ago
Syntactic/Semantic Structures for Textual Entailment Recognition
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...
Yashar Mehdad, Alessandro Moschitti, Fabio Massimo...
ENTCS
2006
150views more  ENTCS 2006»
15 years 6 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota