164 search results - page 23 / 33 » Rewriting Extended Regular Expressions |
MICRO
2000
IEEE
15 years 6 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
101
click to vote
MFCS
1998
Springer
15 years 5 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
134
click to vote
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
We describe a novel approach for content-based publish/subscribe system in mobile ad-hoc networks and show preliminary experiment results. We extended ODMRP (OnDemand Multicast Rou...
111
click to vote
NAACL
2010
14 years 11 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
120
click to vote
PODS
2004
ACM
16 years 1 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...