Sciweavers

2643 search results - page 87 / 529
» Higher order messaging
Sort
View
ECCC
2011
188views ECommerce» more  ECCC 2011»
14 years 11 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
ATAL
2007
Springer
15 years 10 months ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
FSE
2005
Springer
119views Cryptology» more  FSE 2005»
15 years 9 months ago
The Poly1305-AES Message-Authentication Code
Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length messa...
Daniel J. Bernstein
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
15 years 10 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
JETAI
2008
93views more  JETAI 2008»
15 years 4 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal