4908 search results - page 365 / 982 » On the Complexity of Optimal K-Anonymity |
159
click to vote
IFL
2003
Springer
16 years 16 hour ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
196
click to vote
IPTPS
2003
Springer
16 years 9 hour ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
264
Voted
HOLOMAS
2009
Springer
15 years 11 months ago
2009
Springer
The paper gives overview of a multi-agent real-time scheduler for the European operation of one of the largest rent-a-car company in the world. It describes requirements for schedu...
179
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
162
click to vote
COMPGEOM
1991
ACM
15 years 10 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...