394 search results - page 26 / 79 » Computing Minimal Polynomials of Matrices |
140
click to vote
SIAMJO
2010
14 years 11 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
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...
125
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...
120
Voted
KI
2007
Springer
15 years 6 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...