1445 search results - page 154 / 289 » Uniformly Hard Languages |
186
click to vote
ACL
2009
15 years 4 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
200
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
136
click to vote
COLING
2010
15 years 1 months ago
2010
Multi-word expressions constitute a significant portion of the lexicon of every natural language, and handling them correctly is mandatory for various NLP applications. Yet such e...
169
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
180
click to vote
JAPLL
2010
15 years 1 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...