Sciweavers

4057 search results - page 647 / 812
» Linear combination of transformations
Sort
View
WACV
2007
IEEE
14 years 2 months ago
Fast Multi-scale Template Matching Using Binary Features
Template matching is one of the key problems in computer vision and has been widely used in tracking, recognition and many other applications. Traditional methods are usually slow...
Feng Tang, Hai Tao
ACCV
2007
Springer
14 years 2 months ago
Fast 3-D Interpretation from Monocular Image Sequences on Large Motion Fields
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
Jong-Sung Kim, Ki-Sang Hong
COLT
2007
Springer
14 years 2 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CONCUR
2007
Springer
14 years 2 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
CP
2007
Springer
14 years 2 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown