Sciweavers

321 search results - page 3 / 65
» Implementing Randomized Matrix Algorithms in Parallel and Di...
Sort
View
118
Voted
ISCOPE
1999
Springer
15 years 6 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
PPAM
2005
Springer
15 years 7 months ago
SILC: A Flexible and Environment-Independent Interface for Matrix Computation Libraries
We propose a new framework, named Simple Interface for Library Collections (SILC), that gives users access to matrix computation libraries in a flexible and environment-independen...
Tamito Kajiyama, Akira Nukada, Hidehiko Hasegawa, ...
TNN
2008
152views more  TNN 2008»
15 years 2 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
JDA
2008
100views more  JDA 2008»
15 years 2 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
SPAA
1999
ACM
15 years 6 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....