70 search results - page 6 / 14 » Approximation Reformulations |
APPROX
2010
Springer
13 years 10 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...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
ICMLA
2008
13 years 10 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...