194 search results - page 4 / 39 » Computing Roundness is Easy if the Set is Almost Round |
STACS
2005
Springer
13 years 11 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
FC
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
MP
1998
13 years 5 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
SASO
2007
IEEE
14 years 19 hour ago
2007
IEEE
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...