Sciweavers

164 search results - page 10 / 33
» Adaptive Algorithms for Planar Convex Hull Problems
Sort
View
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
13 years 11 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 9 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 7 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
CATS
2007
13 years 9 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
COLT
2005
Springer
14 years 1 months ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...