Sciweavers

28357 search results - page 295 / 5672
» Communications
Sort
View
ICC
2007
IEEE
254views Communications» more  ICC 2007»
15 years 10 months ago
Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks
Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory...
Yong Wang, Byrav Ramamurthy
161
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
APSEC
2001
IEEE
15 years 10 months ago
Knowledge Scouts: Reducing Communication Barriers in a Distributed Software Development Project
As a result of globalization, mergers, acquisitions, and scarce skills, software development is increasingly more distributed. Distribution, however, introduces major communicatio...
Allen H. Dutoit, Joyce Johnstone, Bernd Brügg...
CODES
2001
IEEE
15 years 10 months ago
A trace transformation technique for communication refinement
Models of computation like Kahn and dataflow process networks provide convenient means for modeling signal processing applicahis is partly due to the abstract primitives that thes...
Paul Lieverse, Pieter van der Wolf, Ed F. Deprette...
141
Voted
FOCS
1992
IEEE
15 years 10 months ago
Separating the Communication Complexities of MOD m and MOD p Circuits
: We prove in this paper that it is much harder to evaluate depth
Vince Grolmusz