Sciweavers

ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 4 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
LAWEB
2003
IEEE
13 years 10 months ago
Syntactic Similarity of Web Documents
This paper presents and compares two methods for evaluating the syntactic similarity between documents. The first method uses the Patricia tree, constructed from the original doc...
Álvaro R. Pereira Jr., Nivio Ziviani