Sciweavers

6 search results - page 1 / 2
» A New Trade-Off for Deterministic Dictionaries
Sort
View
SWAT
2000
Springer
107views Algorithms» more  SWAT 2000»
13 years 8 months ago
A New Trade-Off for Deterministic Dictionaries
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
Rasmus Pagh
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 4 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 4 months ago
On some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
TALG
2008
124views more  TALG 2008»
13 years 4 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
WIA
2001
Springer
13 years 9 months ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...