Sciweavers

244 search results - page 36 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
ECCV
2002
Springer
14 years 9 months ago
Linear Pose Estimation from Points or Lines
Estimation of camera pose from an image of n points or lines with known correspondence is a thoroughly studied problem in computer vision. Most solutions are iterative and depend o...
Adnan Ansar, Konstantinos Daniilidis
ICCV
2005
IEEE
14 years 9 months ago
Segmentation of Hybrid Motions via Hybrid Quadratic Surface Analysis
In this paper, we investigate the mathematical problem underlying segmentation of hybrid motions: Given a series of tracked feature correspondences between two (perspective) image...
Shankar Rao, Allen Y. Yang, Andrew Wagner, Yi Ma
ICML
2004
IEEE
14 years 8 months ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer