Sciweavers

2303 search results - page 270 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
ICPP
2009
IEEE
15 years 11 months ago
Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
ICVS
2009
Springer
15 years 11 months ago
GPU-Accelerated Nearest Neighbor Search for 3D Registration
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
Deyuan Qiu, Stefan May, Andreas Nüchter
IPPS
2006
IEEE
15 years 10 months ago
Reconfigurable communications for image processing applications
: This work tries to reuse programmable communication resources like a Network-on-Chip (NoC) in the acceleration of image applications. We show a mathematical model for the computa...
André Borin Soares, Luigi Carro, Altamiro A...
HPDC
2009
IEEE
15 years 11 months ago
Trace-based evaluation of job runtime and queue wait time predictions in grids
Large-scale distributed computing systems such as grids are serving a growing number of scientists. These environments bring about not only the advantages of an economy of scale, ...
Omer Ozan Sonmez, Nezih Yigitbasi, Alexandru Iosup...
ISMB
1994
15 years 5 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe