757 search results - page 14 / 152 » On the hardness of approximating Max-Satisfy |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ICC
2009
IEEE
2009
IEEE
Iterative Detection and Decoding for Hard-Decision Forwarding Aided Cooperative Spatial Multiplexing
15 years 4 months ago
— In this paper, 1 the optimal decoding strategy for cooperative spatial multiplexing (CSM) aided systems is derived. In CSM systems, the multiple relay stations (RSs), which com...
TSD
2005
Springer
15 years 3 months ago
2005
Springer
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
TAMC
2010
Springer
14 years 8 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
68
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...