15073 search results - page 367 / 3015 » Probabilistic algorithms for computing resultants |
136
Voted
BMCBI
2007
15 years 5 months ago
2007
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
173
click to vote
DAC
2004
ACM
16 years 6 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
176
click to vote
JOC
2010
14 years 12 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
152
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
138
Voted
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...