Sciweavers

2563 search results - page 34 / 513
» Parallel matrix algorithms and applications
Sort
View
PDPTA
2003
13 years 11 months ago
The Performance of Routing Algorithms under Bursty Traffic Loads
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
Jeonghee Shin, Timothy Mark Pinkston
EUROPAR
2011
Springer
12 years 9 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
IPPS
2008
IEEE
14 years 4 months ago
On the representation and multiplication of hypersparse matrices
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 ...
Aydin Buluç, John R. Gilbert
ICMCS
2006
IEEE
115views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Similar Segment Detection for Music Structure Analysis via Viterbi Algorithm
The analysis of audio signals of popular and rock songs of the versechorus form to reconstruct its original musical structures is investigated in this work. We first compute the ...
Yu Shiu, Hong Jeong, C. C. Jay Kuo
TPDS
1998
92views more  TPDS 1998»
13 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu