Sciweavers

167 search results - page 19 / 34
» A distributed scheme for detection of information flows
Sort
View
PLDI
1990
ACM
13 years 11 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
JSAC
2006
181views more  JSAC 2006»
13 years 7 months ago
Information theoretic framework of trust modeling and evaluation for ad hoc networks
Abstract-- The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustwor...
Yan Lindsay Sun, Wei Yu, Zhu Han, K. J. Ray Liu
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 7 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
MOBICOM
2003
ACM
14 years 24 days ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon