Sciweavers

901 search results - page 181 / 181
» On Anonymization of String Data
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 4 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...