Sciweavers

202 search results - page 27 / 41
» Complexity of Collective Communications on NoCs
Sort
View
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 11 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
IMC
2007
ACM
13 years 9 months ago
Interference map for 802.11 networks
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...
Dragos Niculescu
OPODIS
2007
13 years 8 months ago
A Decentralized, Scalable, and Autonomous Grid Monitoring System
Abstract. Grid monitoring systems collect a substantial amount of information on the infrastructure’s status in order to perform various tasks, more commonly to provide a better ...
Laurent Baduel, Satoshi Matsuoka
CONEXT
2009
ACM
13 years 8 months ago
Macroscope: end-point approach to networked application dependency discovery
Enterprise and data center networks consist of a large number of complex networked applications and services that depend upon each other. For this reason, they are difficult to ma...
Lucian Popa 0002, Byung-Gon Chun, Ion Stoica, Jaid...
JSAC
2006
95views more  JSAC 2006»
13 years 7 months ago
A low-rate code-spread and chip-interleaved time-hopping UWB system
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
Kai Li, Xiaodong Wang, Guosen Yue, Li Ping