Sciweavers

2570 search results - page 109 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
EUROPAR
2009
Springer
14 years 8 months ago
A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
Lin Yang, Leiguang Gong, Hong Zhang, John L. Noshe...
ICCV
2003
IEEE
16 years 1 days ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
JSAC
2006
81views more  JSAC 2006»
14 years 10 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
ICS
2009
Tsinghua U.
15 years 4 months ago
Fast and scalable list ranking on the GPU
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...
M. Suhail Rehman, Kishore Kothapalli, P. J. Naraya...
ICIP
2010
IEEE
14 years 8 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen