Sciweavers

242 search results - page 20 / 49
» Compact Fundamental Matrix Computation
Sort
View
CIE
2005
Springer
14 years 11 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
CVPR
2004
IEEE
15 years 11 months ago
Color Lines: Image Specific Color Representation
The problem of deciding whether two pixels in an image have the same real world color is a fundamental problem in computer vision. Many color spaces are used in different applicat...
Ido Omer, Michael Werman
WG
2005
Springer
15 years 3 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
71
Voted
ICPR
2010
IEEE
15 years 2 months ago
Face Recognition Using a Multi-Manifold Discriminant Analysis Method
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
Wankou Yang, Changyin Sun, Lei Zhang
DAC
1999
ACM
15 years 2 months ago
ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization
ENOR is an innovative way to produce provablypassive, reciprocal, and compact representations of RLC circuits. Beginning with the nodal equations, ENOR formulates recurrence relat...
Bernard N. Sheehan