Sciweavers

6365 search results - page 182 / 1273
» Fast Local Computation Algorithms
Sort
View
PPOPP
2010
ACM
16 years 2 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 11 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
TMI
2010
123views more  TMI 2010»
15 years 3 months ago
Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren...
ICPR
2002
IEEE
16 years 6 months ago
Fast Restoration of Colour Movie Scratches
This paper presents a new type of scratch removal algorithm based on a causal adaptive multidimensional multitemporal prediction. The predictor use available information from the ...
Jirí Filip, Michal Haindl
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
15 years 5 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf