518 search results - page 1 / 104 » Beating a Random Assignment |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Technological constraints severely limit the rate at which analog-todigital converters can reliably sample signals. Recently, Tropp et al. proposed an architecture, termed the ran...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
EH
2003
IEEE
13 years 11 months ago
2003
IEEE
The paper deals with a class of image filters in which the evolutionary approach consistently produces excellent and innovative results. Furthermore, a method is proposed that le...
ACL
2006
13 years 7 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...