Sciweavers

2745 search results - page 344 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
187
Voted
CISS
2008
IEEE
16 years 19 days ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
CIBCB
2005
IEEE
15 years 11 months ago
Feature Selection for Microarray Data Using Least Squares SVM and Particle Swarm Optimization
Feature selection is an important preprocessing technique for many pattern recognition problems. When the number of features is very large while the number of samples is relatively...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
VC
2008
138views more  VC 2008»
15 years 6 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh
177
Voted
TPDS
2002
136views more  TPDS 2002»
15 years 5 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert