1458 search results - page 48 / 292 » Extended Term Rewriting Systems |
121
Voted
ANCS
2007
ACM
15 years 4 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
139
click to vote
PEPM
2010
ACM
15 years 2 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
115
Voted
EMNLP
2009
14 years 10 months ago
2009
In this paper we address the problem of identifying a broad range of term variations in Japanese web search queries, where these variations pose a particularly thorny problem due ...
128
click to vote
DAGSTUHL
1993
15 years 1 months ago
1993
Abstract. We present the hybrid query language HQL/EER for an Extended Entity-Relationship model. As its main characteristic, this language allows a user to freely mix graphical an...
94
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...