Sciweavers

489 search results - page 23 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
IH
2009
Springer
15 years 5 months ago
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
Nathan Beckmann, Miodrag Potkonjak
TOC
2008
89views more  TOC 2008»
14 years 10 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
INFOCOM
2005
IEEE
15 years 4 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
SG
2009
Springer
15 years 3 months ago
User-Centered Development of a Visual Exploration System for In-Car Communication
Abstract. Modern premium automobiles are equipped with an increasing number of Electronic Control Units (ECUs). These ECUs are interconnected and form a complex network to provide ...
Michael Sedlmair, Benjamin Kunze, Wolfgang Hinterm...
USENIX
1994
14 years 11 months ago
Concert/C: A Language for Distributed Programming
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
Joshua S. Auerbach, Arthur P. Goldberg, Germ&aacut...