20 search results - page 4 / 4 » On the Minimum Augmentation of an l-Connected Graph to a k-C... |
ICRA
2009
IEEE
13 years 12 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
DKE
2006
13 years 5 months ago
2006
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...