Sciweavers

2563 search results - page 157 / 513
» Parallel matrix algorithms and applications
Sort
View
IJPP
2007
91views more  IJPP 2007»
15 years 3 months ago
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato...
ICPR
2000
IEEE
16 years 5 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
IPPS
2008
IEEE
15 years 10 months ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov
IPPS
2007
IEEE
15 years 10 months ago
Packet Loss Burstiness: Measurements and Implications for Distributed Applications
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
David X. Wei, Pei Cao, Steven H. Low
CAP
2010
14 years 11 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...