759 search results - page 100 / 152 » Overlap-Free Regular Languages |
175
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from bu...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
ICSE
2005
IEEE-ACM
15 years 10 months ago
2005
IEEE-ACM
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...