5115 search results - page 310 / 1023 » On Randomized Lanczos Algorithms |
211
click to vote
ESA
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
186
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
164
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
173
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
210
click to vote
AAAI
2010
15 years 8 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...