The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...