Sciweavers

661 search results - page 28 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
BMCBI
2006
109views more  BMCBI 2006»
14 years 12 months ago
A computational approach to discovering the functions of bacterial phytochromes by analysis of homolog distributions
Background: Phytochromes are photoreceptors, discovered in plants, that control a wide variety of developmental processes. They have also been found in bacteria and fungi, but for...
Tilman Lamparter
SASN
2004
ACM
15 years 5 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
JCS
2008
93views more  JCS 2008»
14 years 12 months ago
On the Bayes risk in information-hiding protocols
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
Konstantinos Chatzikokolakis, Catuscia Palamidessi...
INFOCOM
2008
IEEE
15 years 6 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 5 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder