Sciweavers

661 search results - page 34 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
CCR
2006
117views more  CCR 2006»
14 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ASAP
2003
IEEE
108views Hardware» more  ASAP 2003»
15 years 3 months ago
Physical Planning for On-Chip Multiprocessor Networks and Switch Fabrics
On-chip implementation of multiprocessor systems requires the planarization of the interconnect network onto the silicon floorplan. Manual floorplanning approaches will become i...
Terry Tao Ye, Giovanni De Micheli
ICNP
2006
IEEE
15 years 3 months ago
On the Practical and Security Issues of Batch Content Distribution Via Network Coding
— File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers ...
Qiming Li, Dah-Ming Chiu, John C. S. Lui
CSFW
2007
IEEE
15 years 4 months ago
Probability of Error in Information-Hiding Protocols
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
ICDCS
2002
IEEE
15 years 2 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li