Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
Network-based distributed education is a reality today. At George Mason University, we have been pursuing a capability beyond the widespread practice of supporting courses with we...
In order to achieve a high performance in a real implementation of the non-repudiation service it is necessary to estimate timeouts, TTP features, publication key time, number of o...
This paper presents an iterative maximum likelihood framework for motion segmentation via the pairwise checking of pixel blocks. We commence from a characterisation of the motion ...