Sciweavers

365 search results - page 31 / 73
» Weight properties of network codes
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
JIFS
2002
60views more  JIFS 2002»
13 years 8 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
GLOBECOM
2008
IEEE
13 years 9 months ago
Perturbation-Based Distributed Beamforming for Wireless Relay Networks
—This paper deals with distributed beamforming techniques for wireless networks with half-duplex amplify-andforward relays. Existing schemes optimize the beamforming weights base...
Peter Fertl, Ari Hottinen, Gerald Matz
HYBRID
1998
Springer
14 years 26 days ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann
ICASSP
2011
IEEE
13 years 11 days ago
Quantization with an adjustable codeword length penalty
Quantizers are generally designed either for fixed-rate coding or variable-rate coding. Under common conditions, variable-rate quantization leads to the same mean distortion for ...
W. Bastiaan Kleijn, Moo Young Kim