Results 1  10
of
20,743
Deterministic Dictionaries
, 2001
"... It is shown that a static dictionary that offers constanttime access to n elements with wbit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unitcost RAM with word length w and a standard instruction set including multiplication. Whereas a rando ..."
Abstract

Cited by 40 (3 self)
 Add to MetaCart
It is shown that a static dictionary that offers constanttime access to n elements with wbit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unitcost RAM with word length w and a standard instruction set including multiplication. Whereas a
Faster Deterministic Dictionaries
 IN 11 TH ANNUAL ACM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA
, 1999
"... We consider static dictionaries over the universe U = on a unitcost RAM with word size w. Construction of a static dictionary with linear space consumption and constant lookup time can be done in linear expected time by a randomized algorithm. In contrast, the best previous deterministic a ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We consider static dictionaries over the universe U = on a unitcost RAM with word size w. Construction of a static dictionary with linear space consumption and constant lookup time can be done in linear expected time by a randomized algorithm. In contrast, the best previous deterministic
ON SOME DETERMINISTIC DICTIONARIES SUPPORTING SPARSITY
"... To appear in the special issue of JFAA on sparsity Abstract. 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 …nite groups. The oscillator dictionary consists of approximately p5 uni ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
To appear in the special issue of JFAA on sparsity Abstract. 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 …nite groups. The oscillator dictionary consists of approximately p5
A New Tradeoff for Deterministic Dictionaries
, 2000
"... . We consider dictionaries over the universe U = f0; 1g w on a unitcost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with membership queries in time (log log n) O(1) and updates in time (log n) O(1) , where n is the size of the se ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We consider dictionaries over the universe U = f0; 1g w on a unitcost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with membership queries in time (log log n) O(1) and updates in time (log n) O(1) , where n is the size
DETERMINISTIC DICTIONARIES FOR SPARSITY: A GROUP REPRESENTATION APPROACH
"... We describe two deterministic constructions of dictionaries of functions on the finite line which support certain degree of sparsity. 1. ..."
Abstract
 Add to MetaCart
We describe two deterministic constructions of dictionaries of functions on the finite line which support certain degree of sparsity. 1.
Compressed Sensing and Redundant Dictionaries
"... This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry con ..."
Abstract

Cited by 137 (13 self)
 Add to MetaCart
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry
Deterministic Concurrency
 UNIVERSITY OF BRISTOL
, 1993
"... Existing functional languages appear not to be suitable for implementing systems which are inherently concurrent, such as operating system environments. Adaptations to functional languages developed to support such applications have in the past always involved the introduction of nondeterminism.
..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Existing functional languages appear not to be suitable for implementing systems which are inherently concurrent, such as operating system environments. Adaptations to functional languages developed to support such applications have in the past always involved the introduction of nondeterminism.
A TradeOff For WorstCase Efficient Dictionaries
, 2000
"... We consider dynamic dictionaries over the universe U = {0, 1}^w on a unitcost RAM with word size w and a standard instruction set, and present a linear space deterministic dictionary accommodating membership queries in time (log log n)^O(1) and updates in time (log n)^O(1), where n is the size of t ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We consider dynamic dictionaries over the universe U = {0, 1}^w on a unitcost RAM with word size w and a standard instruction set, and present a linear space deterministic dictionary accommodating membership queries in time (log log n)^O(1) and updates in time (log n)^O(1), where n is the size
Results 1  10
of
20,743