Sciweavers

557 search results - page 49 / 112
» On the set multi-cover problem in geometric settings
Sort
View
NIPS
2004
13 years 10 months ago
Surface Reconstruction using Learned Shape Models
We consider the problem of geometrical surface reconstruction from one or several images using learned shape models. While humans can effortlessly retrieve 3D shape information, t...
Jan Erik Solem, Fredrik Kahl
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 10 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
ICPR
2006
IEEE
14 years 10 months ago
Dimensionality Reduction with Adaptive Kernels
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
Shuicheng Yan, Xiaoou Tang
JMIV
2010
131views more  JMIV 2010»
13 years 7 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
14 years 1 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani