Sciweavers

1243 search results - page 24 / 249
» On the locality of bounded growth
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
ESANN
2006
13 years 9 months ago
Discriminacy of the minimum range approach to blind separation of bounded sources
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...
Dinh-Tuan Pham, Frédéric Vrins
AMC
2007
81views more  AMC 2007»
13 years 7 months ago
The Korteweg-de Vries-Kawahara equation in a bounded domain and some numerical results
We are concerned with the initial-boundary problem associated to the Korteweg–de Vries–Kawahara perturbed by a dispersive term which appears in several fluids dynamics proble...
Juan Carlos Ceballos, Mauricio Sepúlveda, O...
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar