1541 search results - page 253 / 309 » Analysis of Random Noise and Random Walk Algorithms |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
RECOMB
2004
Springer
14 years 8 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...
PODS
2006
ACM
14 years 8 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...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
STOC
1993
ACM
14 years 4 days ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...