Sciweavers

126 search results - page 10 / 26
» Storing a Compressed Function with Constant Time Access
Sort
View
GI
2008
Springer
13 years 8 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang
IPPS
2000
IEEE
14 years 2 days ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
SIGIR
2012
ACM
11 years 10 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
COLT
2010
Springer
13 years 5 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 8 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel