Sciweavers

1486 search results - page 92 / 298
» Algorithms for two-box covering
Sort
View
ICIP
2006
IEEE
16 years 5 months ago
Determining Achievable Rates for Secure, Zero Divergence, Steganography
In steganography (the hiding of data into innocuous covers for secret communication) it is difficult to estimate how much data can be hidden while still remaining undetectable. To...
Kenneth Sullivan, Kaushal Solanki, B. S. Manjunath...
136
Voted
SECON
2007
IEEE
15 years 10 months ago
A Framework for Resilient Online Coverage in Sensor Networks
—We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor cov...
Ossama Younis, Marwan Krunz, Srinivasan Ramasubram...
UIC
2007
Springer
15 years 10 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
15 years 7 months ago
BddCut: Towards Scalable Symbolic Cut Enumeration
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
CSREASAM
2006
15 years 5 months ago
A New Robust and Secure Steganographic System for Greyscale Images
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
Hesham Elzouka