Sciweavers

88 search results - page 6 / 18
» Sparse Matrix Implementation in Octave
Sort
View
AC
2008
Springer
15 years 1 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah
99
Voted
ITNG
2007
IEEE
15 years 8 months ago
FPGA-based Vector Processing for Matrix Operations
A programmable vector processor and its implementation with a field-programmable gate array (FPGA) are presented. This processor is composed of a vector core and a tightly couple...
Hongyan Yang, Sotirios G. Ziavras, Jie Hu
LCPC
1998
Springer
15 years 6 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
CORR
2011
Springer
222views Education» more  CORR 2011»
14 years 5 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
145
Voted
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 9 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled