Sciweavers

666 search results - page 95 / 134
» The Pipelined Set Cover Problem
Sort
View
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
13 years 10 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
DKE
2002
107views more  DKE 2002»
13 years 10 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
IVC
2000
179views more  IVC 2000»
13 years 10 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 9 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 4 months ago
Maximizing Angle Coverage in Visual Sensor Networks
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
Kit-Yee Chow, King-Shan Lui, Edmund Y. Lam