Sciweavers

6045 search results - page 343 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TWC
2008
121views more  TWC 2008»
15 years 7 months ago
Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic Rates
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
Ian C. Wong, Brian L. Evans
197
Voted
DAGSTUHL
2007
15 years 9 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
ESANN
2004
15 years 9 months ago
Implementation and coupling of dynamic neurons through optoelectronics
Abstract. In this work we describe experimental results regarding an optoelectronic implementation of a dynamic neuron model. The model is a variation of the FitzHugh-Nagumo equati...
Alexandre R. S. Romariz, Kelvin Wagner
ACTA
2006
154views more  ACTA 2006»
15 years 7 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
TIT
2008
123views more  TIT 2008»
15 years 7 months ago
Geometric Upper Bounds on Rates of Variable-Basis Approximation
In this paper, approximation by linear combinations of an increasing number n of computational units with adjustable parameters (such as perceptrons and radial basis functions) is ...
Vera Kurková, Marcello Sanguineti