2254 search results - page 39 / 451 » Computing the minimal covering set |
IWDC
2005
Springer
14 years 3 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
CSFW
2005
IEEE
14 years 3 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
MMSEC
2006
ACM
14 years 3 months ago
2006
ACM
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
MST
2010
13 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
CONSTRAINTS
2007
13 years 10 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...