194 search results - page 36 / 39 » Computing Roundness is Easy if the Set is Almost Round |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
BMCBI
2008
13 years 7 months ago
2008
Background: Testing for selection is becoming one of the most important steps in the analysis of multilocus population genetics data sets. Existing applications are difficult to u...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
LOCA
2009
Springer
14 years 2 months ago
2009
Springer
With proliferation of ubiquitous computing, digital access is facing an increasing risk since unauthorized client located at any place may intrude a local server. Location Based Ac...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...