299 search results - page 19 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
98
Voted
TSMC
2008
15 years 3 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
114
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
119
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
124
click to vote
COMPGEOM
2006
ACM
15 years 10 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...
139
click to vote
AAAI
1997
15 years 5 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...