Sciweavers

4894 search results - page 899 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
AAAI
2012
13 years 8 days ago
On Maxsum Fair Cake Divisions
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...
CVPR
2007
IEEE
15 years 12 months ago
Regression tracking with data relevance determination
This paper 1 addresses the problem of efficient visual 2D template tracking in image sequences. We adopt a discriminative approach in which the observations at each frame yield di...
Ioannis Patras, Edwin R. Hancock
ICCV
2007
IEEE
15 years 12 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICCV
2005
IEEE
15 years 11 months ago
Towards Ultimate Motion Estimation: Combining Highest Accuracy with Real-Time Performance
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...
Andrés Bruhn, Joachim Weickert
ECCV
2008
Springer
15 years 11 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....