3656 search results - page 377 / 732 » Compact Location Problems |
181
click to vote
GD
2005
Springer
16 years 7 days ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
165
click to vote
IPSN
2005
Springer
16 years 6 days ago
2005
Springer
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...
185
click to vote
MSN
2005
Springer
16 years 6 days ago
2005
Springer
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
154
click to vote
SIGMETRICS
2004
ACM
16 years 4 days ago
2004
ACM
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
186
click to vote
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...