Sciweavers

876 search results - page 117 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
WOWMOM
2005
ACM
115views Multimedia» more  WOWMOM 2005»
15 years 6 months ago
Precise Distributed Localization Algorithms for Wireless Networks
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Saad Biaz, Yiming Ji
TCC
2005
Springer
77views Cryptology» more  TCC 2005»
15 years 6 months ago
Upper and Lower Bounds on Black-Box Steganography
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russ...
DATE
2000
IEEE
101views Hardware» more  DATE 2000»
15 years 5 months ago
Memory Arbitration and Cache Management in Stream-Based Systems
With the ongoing advancements in VLSI technology, the performance of an embedded system is determined to a large extend by the communication of data and instructions. This results...
Françoise Harmsze, Adwin H. Timmer, Jef L. ...
ECSA
2010
Springer
15 years 2 months ago
On the effectiveness of the metamorphic shield
In this paper we analyze the effectiveness of dynamic artificial diversity, i.e., artificial diversity in which the subject of the diversity is re-randomized periodically. We refer...
Anh Nguyen-Tuong, Andrew Wang, Jason Hiser, John C...
AAI
2006
86views more  AAI 2006»
15 years 1 months ago
Geometric Task Decomposition in a Multi-Agent Environment
Task decomposition in a multi-agent environment is often performed online. This paper proposes a method for subtask allocation that can be performed before the agents are deployed...
Kaivan Kamali, Dan Ventura, Amulya Garga, Soundar ...