Sciweavers

184 search results - page 5 / 37
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
14 years 1 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
COMGEO
2008
ACM
13 years 7 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...
CCCG
2010
13 years 9 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
ECML
2006
Springer
13 years 11 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
13 years 11 months ago
A Framework for Battery-Aware Sensor Management
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
Sridhar Dasika, Sarma B. K. Vrudhula, Kaviraj Chop...