1040 search results - page 192 / 208 » Rounding algorithms for covering problems |
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
107
click to vote
ORL
2006
14 years 9 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
COMPGEOM
1994
ACM
15 years 1 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
97
Voted
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...