✦ LIBER ✦

Average-Case Analysis of Approximate Trie Search

✍ Scribed by Moritz G. Maass

Book ID: 106148672
Publisher: Springer
Year: 2006
Tongue: English
Weight: 324 KB
Volume: 46
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-0126-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average Case Analysis of Searching in As

Average Case Analysis of Searching in Associative Processing

✍ Panagiotis E Nastou; Dimitrios N Serpanos; Dimitrios G Maritsas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 804 KB

We introduce an average case analysis of the search primitive operations (equality and thresholding) in associative memories. We provide a general framework for analysis, using as parameters the word space distribution and the CAM size parameters: m (number of memory words) and n (memory word length

Average-case analysis of VCG with approx

Average-case analysis of VCG with approximate resource allocation algorithms

✍ Yevgeniy Vorobeychik; Yagil Engel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Average case analysis of region search i

Average case analysis of region search in balanced k-d trees

✍ Y.V. Silva-Filho 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Average-Case Non-Approximability of Opti

Average-Case Non-Approximability of Optimisation Problems

✍ Birgit Schelm 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB

The shortest common superstring problem:

The shortest common superstring problem: average case analysis for both exact and approximate matching

✍ En-hui Yang; Zhen Zhang 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 736 KB

Average Case Analysis of Marking Algorit

Average Case Analysis of Marking Algorithms

✍ Hirschberg, D. S.; Larmore, L. L. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 726 KB