230 search results - page 44 / 46 » The Inclusion Problem for Regular Expressions |
EUROCRYPT
2004
Springer
14 years 27 days ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
IPSN
2004
Springer
14 years 26 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
DAGM
2003
Springer
14 years 22 days ago
2003
Springer
We provide an overview of spline and wavelet techniques with an emphasis on applications in pattern recognition. The presentation is divided in three parts. In the first one, we ar...
SIGIR
1998
ACM
13 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
FP
1989
13 years 11 months ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...