Sciweavers

5752 search results - page 378 / 1151
» Informative Labeling Schemes
Sort
View
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 10 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
ISPA
2004
Springer
15 years 10 months ago
Asynchronous Document Dissemination in Dynamic Ad Hoc Networks
Abstract This paper presents a document-oriented model for information dissemination in dynamic ad hoc networks, such as those composed of highly mobile and volatile communicating ...
Frédéric Guidec, Hervé Roussa...
SSPR
2000
Springer
15 years 8 months ago
Lossless Compression of Surfaces Described as Points
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information...
Juan Ramón Rico-Juan, Jorge Calera-Rubio, R...
ICWN
2004
15 years 6 months ago
A Peer-to-Peer Approach to Asynchronous Data Dissemination in Ad Hoc Networks
Abstract--This paper presents a model for the dissemination of information in highly dynamic ad hoc networks, such as those composed of mobile communicating devices. This model rel...
Hervé Roussain, Frédéric Guid...
BROADNETS
2007
IEEE
15 years 11 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...