Title:
Analysis of Error-Resilient LZ'77
Speaker:
Mark Ward
Subject:
Analysis of algorithms; data compression; suffix trees; tries; Poissonization; Mellin transform; redundancy; pattern matching.
Area:
Mathematics
Type of school:
School name:
MSRI
Country:
United States
Course language:
English (United States)
Course media:
Video
Course duration:
Contributor:
jakob sandvad
Comments:
Speaker : Mark Ward
Keywords : Analysis of algorithms; data compression; suffix trees; tries; Poissonization; Mellin transform; redundancy; pattern matching.
Abstract : We present the asympotics of the distribution and moments of Mn, the matching multiplicity parameter, for tries constructed on independent strings. We also present work-in-progress that Mn for suffix trees has the same asympotic distribution and moments.
This item is part of the collection: Math Lectures from MSRI
About this Item
Audience: Learner: College
Date: Thursday, June 17th, 2004
Language: English
Audio/Visual: sound, color