Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...