In this paper, we present a novel on-line probabilistic generative model that simultaneously deals with both the clustering and the tracking of an unknown number of moving objects...
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
— Energy-ef ciency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. In this paper, we investigate the relationship between sensor n...
—The prospects of Optical Burst Switching (OBS) as a cost-effective switching paradigm for future all-optical transport networks would greatly benefit from minimizing the number ...