Sciweavers

6365 search results - page 368 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2005
IEEE
15 years 8 months ago
Fast Illumination-Invariant Background Subtraction Using Two Views: Error Analysis, Sensor Placement and Applications
Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the u...
Ser-Nam Lim, Anurag Mittal, Larry S. Davis, Nikos ...
ICCV
2009
IEEE
15 years 4 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
IPPS
2006
IEEE
16 years 24 days ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
NCA
2003
IEEE
16 years 1 days ago
SWIFT: Scheduling in Web Servers for Fast Response Time
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...
Mayank Rawat, Ajay D. Kshemkalyani
IBPRIA
2011
Springer
14 years 10 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...