1941 search results - page 4 / 389 » On the Hardness of Approximate Reasoning |
TOSEM
2008
13 years 8 months ago
2008
FOCS
1995
IEEE
14 years 3 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
NIPS
2007
13 years 10 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
CCS
2006
ACM
14 years 8 days ago
2006
ACM
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...