6315 search results - page 45 / 1263 » Approximating Solution Structure |
128
Voted
AUTOMATICA
2008
15 years 27 days ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
FUIN
2006
15 years 23 days ago
2006
Abstract. Several residuated algebras are taken into account. The set of axioms defining each structure is reduced with the aim to obtain an independent axiomatization. Further, th...
84
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
103
Voted
RECOMB
2002
Springer
16 years 1 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
126
click to vote
FOCM
2010
14 years 11 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...