236 search results - page 11 / 48 » Fast Sparse Matrix Multiplication |
DAGSTUHL
2006
13 years 8 months ago
2006
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
FOCS
2010
IEEE
13 years 5 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...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
SODA
1996
ACM
13 years 8 months ago
1996
ACM
TIT
2008
13 years 7 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...