2254 search results - page 49 / 451 » Computing the minimal covering set |
ICCV
2011
IEEE
12 years 10 months ago
2011
IEEE
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
IPCO
2007
13 years 11 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
IJSNET
2006
13 years 10 months ago
2006
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
ICCV
2003
IEEE
14 years 12 months ago
2003
IEEE
This paper describes a new and simple method of recovering the geometry of uncalibrated circular motion or single axis motion using a minimal data set of 2 points in 4 images. Thi...
ICPP
2005
IEEE
14 years 3 months ago
2005
IEEE
In a PC cluster with Ethernet, well-distributed multiple paths among hosts can be obtained by applying VLAN technology. In this paper, we propose VLAN topology sets and path assig...