Sciweavers

359 search results - page 40 / 72
» On Complete Primitives for Fairness
Sort
View
JFR
2006
130views more  JFR 2006»
15 years 20 days ago
A mobile robot system for automatic floor marking
This paper describes a patent awarded system for automatically marking the positions of stands for a trade fair or exhibition. The system has been in operation since August 2003 a...
Patric Jensfelt, Gunnar Gullstrand, Erik Före...
99
Voted
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 6 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
88
Voted
PODC
2009
ACM
16 years 1 months ago
Dynamic atomic storage without consensus
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...
Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkh...
133
Voted
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 7 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
96
Voted
FC
2005
Springer
98views Cryptology» more  FC 2005»
15 years 6 months ago
Secure Biometric Authentication for Weak Computational Devices
This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can...
Mikhail J. Atallah, Keith B. Frikken, Michael T. G...