High-performance I/O systems depend on prefetching and caching in order to deliver good performance to applications. These two techniques have generally been considered in isolati...
Tracy Kimbrel, Andrew Tomkins, R. Hugo Patterson, ...
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen...
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...