7264 search results - page 10 / 1453 » A multiplicative up-propagation algorithm |
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
COMCOM
2002
13 years 9 months ago
2002
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communication networks. This paper discuss...
JACM
2002
13 years 9 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
MST
2007
13 years 9 months ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...
FOCS
2010
IEEE
13 years 7 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...