Sciweavers

619 search results - page 95 / 124
» Random Bichromatic Matchings
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 2 months 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
INFOCOM
2003
IEEE
14 years 2 months ago
Distributed Queueing in Scalable High Performance Routers
—This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar ...
Prashanth Pappu, Jyoti Parwatikar, Jonathan S. Tur...
PODC
2003
ACM
14 years 2 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
AI
2003
Springer
14 years 2 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
AVBPA
2003
Springer
184views Biometrics» more  AVBPA 2003»
14 years 2 months ago
Biometric Template Selection: A Case Study in Fingerprints
Abstract. A biometric authentication system operates by acquiring biometric data from a user and comparing it against the template data stored in a database in order to identify a ...
Anil K. Jain, Umut Uludag, Arun Ross