Sciweavers

2570 search results - page 102 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
PPOPP
2010
ACM
15 years 7 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
VISUALIZATION
1999
IEEE
15 years 2 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 4 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 ...
ICPR
2002
IEEE
15 years 11 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»
14 years 10 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