Sciweavers

693 search results - page 42 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
93
Voted
CVPR
1999
IEEE
15 years 5 months ago
Efficient Iterative Solution to M-View Projective Reconstruction Problem
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...
Qian Chen, Gérard G. Medioni
NIPS
2004
15 years 2 months ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
ET
2000
80views more  ET 2000»
15 years 1 months ago
A New Method for Testing Re-Programmable PLAs
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...
Charles E. Stroud, James R. Bailey, Johan R. Emmer...
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 1 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
ICANN
2005
Springer
15 years 7 months ago
Handwritten Digit Recognition with Nonlinear Fisher Discriminant Analysis
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
Pietro Berkes