18306 search results - page 136 / 3662 » Algorithmics in Exponential Time |
147
click to vote
ACL
2011
14 years 10 months ago
2011
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...
205
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
137
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying ...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
175
click to vote
IJCAI
2007
15 years 7 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...