Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Christoph Weidling"'
Publikováno v:
ACM Journal of Experimental Algorithmics. 12:1-25
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic perfect hashing” as described by Dietzfelbinger et al. ( SIAM J. Computing 23 , 1994, pp. 738--761), an extension of the st
Publikováno v:
Theoretical Computer Science. 380(1-2):47-68
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d≥1 be fixed, and assume there are m bins of capacity d each. To each of n≤dm
Autor:
Michael Stübert Berger, Andreas Hofmeier, Kamil Aliyev, Christoph Weidling, Alexander Schill, Klemens Muthmann, Daniel Schuster, Daniel Esser
Publikováno v:
ICDAR
Automatic information extraction from scanned business documents is especially valuable in the application domain of document archiving. But current systems for automated document processing still require a lot of configuration work that can only be
Publikováno v:
Automata, Languages and Programming ISBN: 9783540275800
ICALP
ICALP
We study an aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”). Assume there are n balls and m =(1+e) n /d bins of capacity d each, for a fixed d≥1. To each of the balls two possible bins are assigned at rando
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48dace3473528a7bce5c677f41886858
https://doi.org/10.1007/11523468_14
https://doi.org/10.1007/11523468_14