2542 search results - page 4 / 509 » Computing Cartograms with Optimal Complexity |
62
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
94
Voted
ASIACRYPT
2005
Springer
15 years 6 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...
114
Voted
AAAI
2010
15 years 2 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...
112
Voted
PARLE
1991
15 years 4 months ago
1991
200
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
