We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
Dynamically creating new, composite services "on the fly" using existing ones in a local interaction environment (e.g. a home, meeting room, airport lounge, etc.) presen...
We present rendezvous-based access control for access control in the pre-hospital environment. Rendezvous-based access control is a simple cryptographic access control method that...
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Disk schedulers in current operating systems are generally work-conserving, i.e., they schedule a request as soon as the previous request has finished. Such schedulers often requ...