Sciweavers

1566 search results - page 5 / 314
» On a Cone Covering Problem
Sort
View
CAD
2006
Springer
13 years 7 months ago
Cone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
Xunnian Yang, Weiping Yang
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 26 days ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
ICRA
2009
IEEE
81views Robotics» more  ICRA 2009»
14 years 2 months ago
Representing sets of orientations as convex cones
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
Pål Johan From, Jan Tommy Gravdahl
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 1 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
NIPS
2004
13 years 8 months ago
A Second Order Cone programming Formulation for Classifying Missing Data
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
Chiranjib Bhattacharyya, Pannagadatta K. Shivaswam...