Sciweavers

220 search results - page 10 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 9 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
DM
2008
56views more  DM 2008»
13 years 8 months ago
Point-weight designs with design conditions on t points
This paper examines some of the properties of point-weight incidence structures, i.e. incidence structures for which every point is assigned a positive integer weight. In particul...
Alexander W. Dent
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
14 years 5 days ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
CVPR
2008
IEEE
14 years 10 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 1 months ago
Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences
Optimizing the hypervolume indicator within evolutionary multiobjective optimizers has become popular in the last years. Recently, the indicator has been generalized to the weight...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...