496 search results - page 89 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
DGCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
ESA
2003
Springer
14 years 25 days ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...