2542 search results - page 4 / 509 » Computing Cartograms with Optimal Complexity |
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
125
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
151
click to vote
AAAI
2010
15 years 6 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
