7150 search results - page 332 / 1430 » An Approximation Algorithm for Approximation Rank |
152
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
156
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
230
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
We propose a mathematical framework for query selection as a mechanism for reducing the cost of constructing information retrieval test collections. In particular, our mathematica...
204
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
168
click to vote
FSTTCS
2003
Springer
15 years 12 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...