1666 search results - page 46 / 334 » Smoothed Motion Complexity |
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
SAGA
2001
Springer
14 years 1 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
SMA
2009
ACM
14 years 3 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
VISUALIZATION
1998
IEEE
14 years 1 months ago
1998
IEEE
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address...
IPCO
2007
13 years 10 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...