Sciweavers

6365 search results - page 74 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
2000
IEEE
16 years 4 months ago
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
Krisda Lengwehasatit, Antonio Ortega
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 2 months ago
Fast computation of power series solutions of systems of differential equations
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
Alin Bostan, Frédéric Chyzak, Fran&c...
NIPS
2008
15 years 3 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
HPCA
1998
IEEE
15 years 6 months ago
Challenging Applications on Fast Networks
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applicatio...
Koen Langendoen, Rutger F. H. Hofman, Henri E. Bal
PARA
1994
Springer
15 years 6 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal