757 search results - page 36 / 152 » On the hardness of approximating Max-Satisfy |
108
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
182
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
ISPD
2009
ACM
15 years 4 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
100
click to vote
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
101
click to vote
SACMAT
2006
ACM
15 years 4 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...