Sciweavers

RSA
2006
91views more  RSA 2006»
13 years 11 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai
NAACL
2007
14 years 26 days ago
A Random Text Model for the Generation of Statistical Language Invariants
A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also ...
Chris Biemann