Sciweavers

209 search results - page 26 / 42
» The Computational Complexity of Weak Saddles
Sort
View
ICRA
2009
IEEE
83views Robotics» more  ICRA 2009»
14 years 2 months ago
Real-time correlative scan matching
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
Edwin B. Olson
CVPR
2007
IEEE
14 years 9 months ago
Kernel Sharing With Joint Boosting For Multi-Class Concept Detection
Object/scene detection by discriminative kernel-based classification has gained great interest due to its promising performance and flexibility. In this paper, unlike traditional ...
Wei Jiang, Shih-Fu Chang, Alexander C. Loui
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
FOCS
2009
IEEE
14 years 2 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner
ICPR
2004
IEEE
14 years 8 months ago
Inter-Stage Feature Propagation in Cascade Building with AdaBoost
A modification of the cascaded detector with the AdaBoost trained stage classifiers is proposed and brought to bear on the face detection problem. The cascaded detector is a seque...
Jan Sochman, Jiri Matas