3894 search results - page 258 / 779 » Approximation Algorithms for Biclustering Problems |
201
click to vote
PAKDD
2009
ACM
16 years 3 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
167
click to vote
IPSN
2007
Springer
16 years 23 days ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
148
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
166
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
190
click to vote
DMSN
2004
ACM
16 years 1 days ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...