4255 search results - page 118 / 851 » Cover |
146
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
131
click to vote
IWDW
2009
Springer
15 years 10 months ago
2009
Springer
We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multip...
133
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
126
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
126
click to vote
ALGOSENSORS
2006
Springer
15 years 7 months ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...