363 search results - page 3 / 73 » About paths with two blocks |
INFOCOM
1995
IEEE
14 years 2 days ago
1995
IEEE
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
ICASSP
2011
IEEE
13 years 8 days ago
2011
IEEE
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
COMBINATORICS
1998
13 years 8 months 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, ...
INFOCOM
1995
IEEE
14 years 2 days ago
1995
IEEE
We introduce a traffic model for circuit-switched all-optical networks which we then use to calculate the blocking probability along a path for networks with and without wavelength...
SLP
1989
13 years 9 months ago
1989
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...