329 search results - page 34 / 66 » New lower bounds for some spherical designs |
WG
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
GOSLER
1995
14 years 1 days ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
ALGORITHMICA
2008
13 years 8 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...