COMBINATORICS
2000
13 years 11 months ago
2000
Let d(n) count the lattice paths from (0, 0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0, 0) to (n, n) with permitted steps from th...
JCT
2007
13 years 11 months ago
2007
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. ...
JCT
2008
13 years 11 months ago
2008
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both ...
COMBINATORICS
2006
13 years 11 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...
EJC
2008
13 years 11 months ago
2008
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...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
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...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
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...