329 search results - page 11 / 66 » New lower bounds for some spherical designs |
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
109
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
106
click to vote
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...