5115 search results - page 564 / 1023 » On Randomized Lanczos Algorithms |
154
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
170
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
153
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
168
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...
168
click to vote
CLUSTER
2009
IEEE
16 years 1 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...