1941 search results - page 87 / 389 » On the Hardness of Approximate Reasoning |
101
click to vote
PODS
2008
ACM
16 years 20 hour ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
117
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
111
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
125
click to vote
CORR
2012
Springer
13 years 7 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...