Sciweavers

4315 search results - page 196 / 863
» Sorting in linear time
Sort
View
TWC
2010
13 years 4 months ago
Optimal Linear Non-Regenerative Multi-Hop MIMO Relays with MMSE-DFE Receiver at the Destination
In this paper, we study multi-hop non-regenerative multiple-input multiple-output (MIMO) relay communications with any number of hops. We design the optimal source precoding matrix...
Yue Rong
ICASSP
2011
IEEE
13 years 1 months ago
Third order widely non linear Volterra MVDR beamforming
It is now well known that time invariant (TI) linear beamformers, such as the Capon’s beamformer, are only optimal for stationary Gaussian observations whose complex envelope is...
Pascal Chevalier, Abdelkader Oukaci, Jean Pierre D...
MFCS
2007
Springer
14 years 3 months ago
Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
Martin Delacourt, Victor Poupet
PODS
2007
ACM
107views Database» more  PODS 2007»
14 years 9 months ago
Polynomial time fragments of XPath with variables
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot...
LICS
2006
IEEE
14 years 3 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco