Sciweavers

1056 search results - page 81 / 212
» Accelerated Shift-and-Add Algorithms
Sort
View
PAMI
2007
253views more  PAMI 2007»
15 years 5 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán
ICPR
2000
IEEE
16 years 7 months ago
Winner-Update Algorithm for Nearest Neighbor Search
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
ISQED
2005
IEEE
119views Hardware» more  ISQED 2005»
15 years 11 months ago
Fast Decap Allocation Algorithm For Robust On-Chip Power Delivery
Adding on-chip decoupling capacitors (decaps) is an effective way to reduce voltage noise in power/ground networks and ensure robust power delivery. In this paper, we present a fa...
Zhenyu Qi, Hang Li, Sheldon X.-D. Tan, Lifeng Wu, ...
SAC
2005
ACM
15 years 11 months ago
Stochastic scheduling of active support vector learning algorithms
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...
Gaurav Pandey, Himanshu Gupta, Pabitra Mitra
ECCV
2010
Springer
15 years 11 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...