CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we construct constant dimension codes with prescribed minimum distance. There is an increased interest in subspace codes in general since a paper [13] by K
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Testing is a vital part of software development, and spreadsheets are like any other software in this respect. This paper discusses the testing of spreadsheets in the light of one...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This article examines rules of style for text, graphics, and mathematics and applies these rules to spreadsheets. The article describes the new style in detail with an example and...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Because spreadsheets have a large and growing importance in real-world work, their contents need to be controlled and validated. Generally spreadsheets have been difficult to veri...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper focuses on the cross-layer issue of resource allocation for energy efficiency in the uplink of a multiuser MIMO wireless communication system. Assuming that all of the ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...