2060 search results - page 7 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ISSAC
1994
Springer
15 years 1 months ago
1994
Springer
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
CASC
2006
Springer
15 years 1 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
79
Voted
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
100
click to vote
CONIELECOMP
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
ESANN
2007
14 years 11 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...