Sciweavers

3707 search results - page 205 / 742
» A Simple Technique for Self-Calibration
Sort
View
PLDI
1994
ACM
15 years 10 months ago
Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback
: 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...
Urs Hölzle, David Ungar
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 10 months ago
Semidefinite programming methods for system realization and identification
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...
Zhang Liu, Lieven Vandenberghe
DASFAA
2004
IEEE
95views Database» more  DASFAA 2004»
15 years 10 months ago
On Incorporating Iceberg Queries in Query Processors
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...
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
15 years 10 months ago
Bucket Hashing and its Application to Fast Message Authentication
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...
Phillip Rogaway
COMPGEOM
2008
ACM
15 years 8 months ago
Tighter bounds for random projections of manifolds
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...
Kenneth L. Clarkson