Sciweavers

307 search results - page 25 / 62
» The convex hull of ellipsoids
Sort
View
EOR
2002
87views more  EOR 2002»
13 years 7 months ago
On the finite convergence of successive SDP relaxation methods
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...
Masakazu Kojima, Levent Tunçel
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 8 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
14 years 2 months ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
14 years 1 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto