557 search results - page 66 / 112 » On the set multi-cover problem in geometric settings |
163
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
166
click to vote
CDC
2008
IEEE
16 years 18 days ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
171
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
159
click to vote
Publication
We present a solution to the mesh tangling problem in surface tracking. Using an explicit triangle mesh to track the location of a surface as it moves in three dimensions has many ...
238
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
We address an unsupervised object detection and segmentation problem that goes beyond the conventional assumptions of one-to-one object correspondences or model-test settings betwe...