273 search results - page 41 / 55 » Compressed String Dictionaries |
AAECC
1990
Springer
13 years 11 months ago
1990
Springer
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
MJ
2006
13 years 7 months ago
2006
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
SPIRE
2000
Springer
13 years 11 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
EISWT
2007
13 years 9 months ago
2007
XML has grown into a widely used and highly developed technology, due in part to the subcomponents built around the technology (advanced parsers, frameworks, libraries, etc). The ...