Sciweavers

57 search results - page 12 / 12
» A functional view of upper bounds on codes
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 5 days ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith