Sciweavers

7047 search results - page 1051 / 1410
» Focusing on Binding and Computation
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 6 days ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
CONCUR
2004
Springer
16 years 6 days ago
The Pros and Cons of Netcharts
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
Nicolas Baudru, Rémi Morin
ESAS
2004
Springer
16 years 5 days ago
Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Mark Manulis, Jörg Schwenk
EURONGI
2004
Springer
16 years 5 days ago
Admission Control in the Downlink of WCDMA/UMTS
In this paper, we develop a novel CAC algorithm that takes into account the mobility of users inside the cell with a focus on the downlink of third generation mobile systems. We ...
Salah-Eddine Elayoubi, Tijani Chahed
FOIKS
2004
Springer
16 years 5 days ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
« Prev « First page 1051 / 1410 Last » Next »