7015 search results - page 334 / 1403 » Approximation algorithms for co-clustering |
191
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...
151
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-...
203
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 &...
143
Voted
SCALESPACE
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...