The cyclic minimum correlation problem
β Scribed by H. S. Witsenhausen
- Publisher
- Springer
- Year
- 1987
- Tongue
- English
- Weight
- 513 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The "minimum vocabulary problem" for a dictionary has applications in indexing and other domains of information retrieval. A simple directed-graph model of a dictionary results in a linear-time algorithm for this problem. Since it is known that many minimum vocabularies can exist for a dictionary, a
The problem of minimizing the number of dummy tasks in a PERT network was shown to be NP-complete by Krishnamoorthy and Deo [9]. Previous methods of dealing with this problem have imposed extra restrictions on the solution [2,4] or have considered "good" exponential algorithms to solve the problem [
One approach to improving the generalization power of a neural net is to try to minimize the number of nonzero weights used. We examine two issues relevant to this approach, .for single-layer nets. First we bound the VC dimension of the set of linear-threshold fimctions that have nonzero weights fig
In this note we solve the following problem: given a full column rank p Γ m transfer function matrix, find the minimum non-negative integers L i, i=l ..... m. such that the equation G(z)F(z) = diag{z -Lt ..... z-t..,} has a proper solution G(z).