518 search results - page 1 / 104 » Beating a Random Assignment |
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
ICASSP
2011
IEEE
14 years 1 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...
111
Voted
FOCS
2008
IEEE
15 years 4 months 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
15 years 2 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...
80
Voted
ACL
2006
14 years 11 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 ...