Sciweavers

732 search results - page 7 / 147
» Testing Geometric Convexity
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
DCG
2008
90views more  DCG 2008»
13 years 7 months ago
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
14 years 2 months ago
On-line time-optimal path tracking for robots
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...
DAGM
2007
Springer
14 years 1 months ago
The Minimum Volume Ellipsoid Metric
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
Karim T. Abou-Moustafa, Frank P. Ferrie
RAS
2007
113views more  RAS 2007»
13 years 7 months ago
From images to rooms
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
Zoran Zivkovic, Olaf Booij, Ben J. A. Kröse