24 search results - page 1 / 5 » Replacement Paths via Fast Matrix Multiplication |
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
SODA
1996
ACM
14 years 3 days ago
1996
ACM
IWPEC
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
MICS
2007
13 years 10 months ago
2007
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
ARITH
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...