: Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not k...
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...
Krishna P. Leela, Pankaj M. Tolani, Jayant R. Hari...
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...