Sciweavers

1973 search results - page 33 / 395
» The Construction of Ludic Space
Sort
View
SIGIR
1992
ACM
14 years 15 days ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
ECIS
2000
13 years 9 months ago
Constructing New Media
: Media are explored to envision, to design, and to implement platforms for knowledge management within communities. They actively shape, support and develop the community being re...
Martina Klose, Ulrike Lechner
NIPS
2000
13 years 9 months ago
APRICODD: Approximate Policy Construction Using Decision Diagrams
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
Robert St-Aubin, Jesse Hoey, Craig Boutilier
TIP
2008
98views more  TIP 2008»
13 years 8 months ago
On the Construction of Invertible Filter Banks on the 2-Sphere
The theories of signal sampling, filter banks, wavelets and "overcomplete wavelets" are well-established for the Euclidean spaces and are widely used in the processing a...
B. T. Thomas Yeo, Wanmei Ou, Polina Golland
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
14 years 2 months ago
How to Enrich the Message Space of a Cipher
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
Thomas Ristenpart, Phillip Rogaway