Sciweavers

164 search results - page 23 / 33
» Rewriting Extended Regular Expressions
Sort
View
MICRO
2000
IEEE
98views Hardware» more  MICRO 2000»
14 years 1 months ago
Efficient conditional operations for data-parallel architectures
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...
Ujval J. Kapasi, William J. Dally, Scott Rixner, P...
MFCS
1998
Springer
14 years 25 days ago
Deadlocking States in Context-Free Process Algebra
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...
Jirí Srba
PERCOM
2004
ACM
14 years 8 months ago
An Adaptive Approach to Content-Based Subscription in Mobile Ad Hoc Networks
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...
Eiko Yoneki, Jean Bacon
NAACL
2010
13 years 6 months ago
Why Synchronous Tree Substitution Grammars?
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...
Andreas Maletti
PODS
2004
ACM
131views Database» more  PODS 2004»
14 years 8 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti