15073 search results - page 318 / 3015 » Probabilistic algorithms for computing resultants |
124
click to vote
WABI
2007
Springer
15 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
158
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
126
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
117
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
149
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...