Sciweavers

193 search results - page 8 / 39
» A New Redundancy Reducing Cipher
Sort
View
DATE
2000
IEEE
87views Hardware» more  DATE 2000»
14 years 8 days ago
Multi-Node Static Logic Implications for Redundancy Identification
This paper presents a method for redundancy identification (RID) using multi-node logic implications. The algorithm discovers a large number of direct and indirect implications b...
Kabir Gulrajani, Michael S. Hsiao
GLOBECOM
2008
IEEE
14 years 2 months ago
Scalable Redundancy for Sensors-to-Sink Communication
—In this paper, we present a new technique that uses deterministic binary network coding in a distributed manner to enhance the resiliency of Sensor-to-Base information flow aga...
Osameh M. Al-Kofahi, Ahmed E. Kamal
ISLPED
1997
ACM
99views Hardware» more  ISLPED 1997»
14 years 1 days ago
Low power data processing by elimination of redundant computations
We suggest a new technique to reduce energy consumption in the processor datapath without sacrificing performance by exploiting operand value locality at run time. Data locality is...
Mir Azam, Paul D. Franzon, Wentai Liu
ICC
2007
IEEE
14 years 2 months ago
Reducing the Size of Rule Set in a Firewall
— A firewall’s complexity is known to increase with the size of its rule set. Complex firewalls are more likely to have configuration errors which cause security loopholes. ...
MyungKeun Yoon, Shigang Chen, Zhan Zhang
ADHOC
2007
144views more  ADHOC 2007»
13 years 8 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac