3082 search results - page 185 / 617 » New Bounds for the Controller Problem |
144
click to vote
CCO
2001
Springer
15 years 9 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
130
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
126
click to vote
JMIV
2006
15 years 4 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
127
Voted
JCS
2000
15 years 4 months ago
2000
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
177
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...