97 search results - page 14 / 20 » Highly Scalable Algorithms for Robust String Barcoding |
APCCAS
2002
IEEE
14 years 20 days ago
2002
IEEE
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract-In traditional cellular systems with fixed base stations the channel reuse pattern is static and deterministic. When the cell layout is dynamic, due to the mobility of bas...
SENSYS
2006
ACM
14 years 1 months ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...