3 search results - page 1 / 1 » Lattice Paths Between Diagonal Boundaries |
123
Voted
COMBINATORICS
1998
15 years 22 days ago
1998
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, ...
116
Voted
EJC
2008
15 years 1 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...
116
Voted
PAMI
2010
14 years 11 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...