7930 search results - page 466 / 1586 » Greedy in Approximation Algorithms |
160
click to vote
COMPGEOM
2007
ACM
15 years 11 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...
171
Voted
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
199
click to vote
AAAI
2007
15 years 9 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
154
click to vote
AUTOMATICA
2006
15 years 7 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-...
209
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...