6315 search results - page 208 / 1263 » Approximating Solution Structure |
156
click to vote
EUROCAST
2005
Springer
16 years 2 days ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
172
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
155
click to vote
NIPS
2004
15 years 8 months ago
2004
Belief propagation (BP) is an increasingly popular method of performing approximate inference on arbitrary graphical models. At times, even further approximations are required, wh...
157
click to vote
DAM
2006
15 years 6 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
185
click to vote
SIAMIS
2011
15 years 1 months ago
2011
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...