740 search results - page 64 / 148 » An approximation ratio for biclustering |
107
click to vote
TNN
2010
14 years 6 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
143
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
128
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
A visually-optimal quantization and rate-control strategy based on results of recent contrast sensitivity and suprathreshold summation experiments is proposed. At suprathreshold c...
113
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...