2200 search results - page 149 / 440 » Bloch's Constant is Computable |
152
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
179
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
177
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
165
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
190
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...