Sciweavers

71 search results - page 4 / 15
» Coxeter Lattice Paths
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Latency-constrained low-complexity lattice reduction for MIMO-OFDM systems
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
Chun-Fu Liao, Fang-Chun Lan, Yuan-Hao Huang, Po-Li...
EJC
2008
14 years 9 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ICASSP
2010
IEEE
14 years 9 months ago
Subword-based spoken term detection in audio course lectures
This paper investigates spoken term detection (STD) from audio recordings of course lectures obtained from an existing media repository. STD is performed from word lattices genera...
Richard Rose, Atta Norouzian, Aarthi Reddy, Andr&e...
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
14 years 9 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen