1052 search results - page 176 / 211 » The Regular Real-Time Languages |
174
click to vote
SIGMOD
2001
ACM
16 years 5 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...
154
click to vote
PODS
2007
ACM
16 years 5 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...
144
click to vote
ICSE
2005
IEEE-ACM
16 years 5 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...
147
click to vote
LATA
2009
Springer
16 years 7 days 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 ...
149
click to vote
VL
2009
IEEE
16 years 6 days ago
2009
IEEE
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...