Sciweavers

1433 search results - page 123 / 287
» On Covering Problems of Rado
Sort
View
PETRA
2009
ACM
16 years 1 months ago
Automatic sensor placement in a 3D volume
Given a 3D environment, a set of constraints, and a set of sensor models, this paper addresses the problem of finding the set of sensors and their corresponding placement that cov...
Eric Becker, Gutemberg Guerra-Filho, Fillia Makedo...
ISCC
2005
IEEE
146views Communications» more  ISCC 2005»
16 years 3 days ago
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
Jean Carle, Antoine Gallais, David Simplot-Ryl
CAV
2001
Springer
121views Hardware» more  CAV 2001»
15 years 11 months ago
A Practical Approach to Coverage in Model Checking
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
Hana Chockler, Orna Kupferman, Robert P. Kurshan, ...
POPL
1999
ACM
15 years 11 months ago
Software Watermarking: Models and Dynamic Embeddings
Watermarking embeds a secret message into a cover message. In media watermarking the secret is usually a copyright notice and the cover a digital image. Watermarking an object dis...
Christian S. Collberg, Clark D. Thomborson
AAAI
2010
15 years 8 months ago
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...