5115 search results - page 578 / 1023 » On Randomized Lanczos Algorithms |
209
Voted
CPM
2007
Springer
16 years 27 days ago
2007
Springer
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
195
click to vote
GBRPR
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
173
click to vote
IDEAL
2007
Springer
16 years 27 days ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
153
click to vote
ISAAC
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
164
click to vote
ISSAC
2007
Springer
16 years 26 days ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...