Sciweavers

Share
190 search results - page 3 / 38
» Restricted Strip Covering and the Sensor Cover Problem
Sort
View
IPSN
2010
Springer
9 years 6 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
DAM
2010
79views more  DAM 2010»
9 years 5 days ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
9 years 7 days ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
JUCS
2010
117views more  JUCS 2010»
8 years 10 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
LATIN
2010
Springer
9 years 7 months ago
Colorful Strips
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
books