507 search results - page 56 / 102 » Computing Sparse Multiples of Polynomials |
WDAG
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
STOC
2012
ACM
11 years 10 months ago
2012
ACM
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
ISCOPE
1998
Springer
13 years 12 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
RECOMB
2010
Springer
14 years 2 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 ...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...