67 search results - page 8 / 14 » Parallel sparse polynomial multiplication using heaps |
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
PPAM
2005
Springer
14 years 29 days ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we analyze the performance of group based detection in sparse sensor networks, when the system level detection decision is made based on the detection reports gener...
FSKD
2011
Springer
12 years 7 months ago
2011
Springer
—This paper describes a model of a hierarchical, heterogeneous knowledge-base. The proposed model consists of an associative level that is implemented by a Kanerva-like sparse di...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...