112 search results - page 11 / 23 » Rounds in Communication Complexity Revisited |
ESAW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
ICICS
2009
Springer
14 years 2 months ago
2009
Springer
The overall structure is one of the most important properties of block ciphers. At present, the most common structures include Feistel structure, SP structure, MISTY structure, L-M...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
CNSR
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper presents a data routing protocol for a non-mobile, locationaware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environm...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...