24 search results - page 2 / 5 » Replacement Paths via Fast Matrix Multiplication |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
ARITH
2005
IEEE
14 years 4 months ago
2005
IEEE
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
MOC
1998
13 years 10 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
VIS
2009
IEEE
15 years 1 days ago
2009
IEEE
Stackless traversal techniques are often used to circumvent memory bottlenecks by avoiding a stack and replacing return traversal with extra computation. This paper addresses wheth...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Probabilistic matrix factorization (PMF) is a powerful method for modeling data associated with pairwise relationships, finding use in collaborative filtering, computational biolo...