Sciweavers

2570 search results - page 81 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CVPR
2012
IEEE
13 years 12 days ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
15 years 4 months ago
An efficient static algorithm for computing the soft error rates of combinational circuits
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
Rajeev R. Rao, Kaviraj Chopra, David Blaauw, Denni...
ICCV
2009
IEEE
14 years 7 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
IBPRIA
2011
Springer
14 years 1 months ago
The Fast and the Flexible: Extended Pseudo Two-Dimensional Warping for Face Recognition
Abstract. In this work, we propose a novel extension of pseudo 2D image warping (P2DW) which allows for joint alignment and recognition of non-rectified face images. P2DW allows f...
Leonid Pishchulin, Tobias Gass, Philippe Dreuw, He...
DAC
2011
ACM
13 years 9 months ago
Fast non-monte-carlo transient noise analysis for high-precision analog/RF circuits by stochastic orthogonal polynomials
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
Fang Gong, Hao Yu, Lei He