2430 search results - page 213 / 486 » Computing Tutte Polynomials |
114
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate ...
132
click to vote
CASC
2009
Springer
15 years 11 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
108
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, a method to generalize previously proposed Chebyshev Kernel function is presented for Support Vector Classification in order to obtain more robust and higher classi...
153
click to vote
ADAEUROPE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
125
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...