599 search results - page 80 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
TOSN
2010
13 years 6 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
NIPS
2004
13 years 9 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
IJCNN
2000
IEEE
14 years 4 days ago
2000
IEEE
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...