7015 search results - page 190 / 1403 » Approximation algorithms for co-clustering |
169
click to vote
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
128
click to vote
CDC
2008
IEEE
16 years 22 days ago
2008
IEEE
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
157
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
127
Voted
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
167
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...