121 search results - page 12 / 25 » Improving branch-and-cut performance by random sampling |
SIGMETRICS
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
BMCBI
2008
14 years 10 months ago
2008
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
BMCBI
2005
14 years 10 months ago
2005
Background: The extensive use of DNA microarray technology in the characterization of the cell transcriptome is leading to an ever increasing amount of microarray data from cancer...
111
click to vote
STOC
2012
ACM
13 years 1 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...
IROS
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...