329 search results - page 27 / 66 » New lower bounds for some spherical designs |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
CMMR
2007
Springer
14 years 2 months ago
2007
Springer
The UCSB Allosphere is a 3-story-high spherical instrument in which virtual environments and performances can be experienced in full immersion. The space is now being equipped with...
FOCS
1999
IEEE
14 years 23 days ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
DCC
2003
IEEE
14 years 1 months ago
2003
IEEE
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
TC
2002
13 years 8 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...