4894 search results - page 225 / 979 » The Guarding Problem - Complexity and Approximation |
214
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
161
click to vote
JCB
2007
15 years 6 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
222
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
179
click to vote
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
147
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...