3894 search results - page 260 / 779 » Approximation Algorithms for Biclustering Problems |
155
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
153
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
170
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
181
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
236
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...