Sciweavers

2 search results - page 1 / 1
» How to Achieve Minimax Expected Kullback-Leibler Distance fr...
Sort
View
ALT
2002
Springer
14 years 1 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 3 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy