Sciweavers

603 search results - page 114 / 121
» Word or Phrase
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 7 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
JAL
2002
113views more  JAL 2002»
13 years 7 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
ORDER
2002
90views more  ORDER 2002»
13 years 7 months ago
Radical Classes of Lattice-Ordered Groups vs. Classes of Compact Spaces
For a given class T of compact Hausdorff spaces, let Y(T ) denote the class of -groups G such that for each g G, the Yosida space Y (g) of g belongs to T . Conversely, if R is a c...
Michael R. Darnel, Jorge Martinez
TIT
1998
216views more  TIT 1998»
13 years 7 months ago
Data Compression and Harmonic Analysis
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
David L. Donoho, Martin Vetterli, Ronald A. DeVore...
TOMACS
1998
140views more  TOMACS 1998»
13 years 7 months ago
Technical Note: A Hierarchical Computer Architecture Design and Simulation Environment
architectures at multiple levels of abstraction, encompassing both hardware and software. It has five modes of operation (Design, Model Validation, Build Simulation, Simulate Syste...
Paul S. Coe, Fred W. Howell, Roland N. Ibbett, Lau...