Sciweavers

224 search results - page 5 / 45
» A Flexible Class of Parallel Matrix Multiplication Algorithm...
Sort
View
PDP
2006
IEEE
14 years 2 months ago
Comparing Commodity SMP System Software with a Matrix Multiplication Benchmark
Commodity symmetric multiprocessors (SMPs), though originally intended for transaction processing, because of their availability, are now used for numerical analysis applications ...
Georgios Tsilikas, Martin Fleury
EUROPAR
2010
Springer
13 years 9 months ago
Optimized Dense Matrix Multiplication on a Many-Core Architecture
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
Elkin Garcia, Ioannis E. Venetis, Rishi Khan, Guan...
FOCS
2010
IEEE
13 years 6 months ago
Replacement Paths via Fast Matrix Multiplication
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...
Oren Weimann, Raphael Yuster
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 6 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin