394 search results - page 42 / 79 » Computing Minimal Polynomials of Matrices |
115
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
105
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
89
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
94
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
95
Voted
ICAI
2007
15 years 1 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...