1272 search results - page 153 / 255 » The Set Cover with Pairs Problem |
ICCV
2001
IEEE
15 years 17 days ago
2001
IEEE
W e address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance...
ALGOSENSORS
2007
Springer
14 years 4 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...
ALT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
AI
2004
Springer
13 years 10 months ago
2004
Springer
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
CPAIOR
2011
Springer
13 years 2 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...