Sciweavers

8933 search results - page 74 / 1787
» Usability over time
Sort
View
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 4 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
IANDC
2006
83views more  IANDC 2006»
14 years 12 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
15 years 4 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
IJNSEC
2010
116views more  IJNSEC 2010»
14 years 6 months ago
Modelling and Analyzing Passive Worms over Unstructured Peer-to-Peer Networks
Passive worm have posed serious security threats to the functioning of unstructured P2P networks. A delayed SEIRS epidemic model with death, off line and online rate is constructe...
Fangwei Wang, Yunkai Zhang, Jianfeng Ma
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 1 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei