๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On probabilities of hash value matches

โœ Scribed by Mohammad Peyravian; Allen Roginsky; Ajay Kshemkalyani

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
494 KB
Volume
17
Category
Article
ISSN
0167-4048

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On probability matching priors
On probability matching priors
โœ Ana-Maria Staicu; Nancy M. Reid ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ French โš– 130 KB
Spatial match retrieval based on directi
Spatial match retrieval based on direction signatures using multiple key hashing scheme
โœ Chin-Chen Chang; Chin-Feng Lee ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB

The spatial relationships among pictorial objects are important spatial characteristics in image database systems. Based on the concept of 9-DLT representation, we propose a new method for effective storage utilization and picture retrieval. First, we transform a symbolic picture into a set of tripl

On the tail probability of the longest w
On the tail probability of the longest well-matching run
โœ C.J. Chang; C.S.J. Fann; W.C. Chou; I.B. Lian ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 198 KB

The distribution of the length of the longest run has wide applications in regard to reliability and DNA sequencing. Statistical tests based on the longest well-matching run are usually considered to be more reasonable than tests based on the perfect-matching run. In this paper, a method adopted fro