We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room f...
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
— Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate di...