Sciweavers

1458 search results - page 48 / 292
» Extended Term Rewriting Systems
Sort
View
ANCS
2007
ACM
15 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
PEPM
2010
ACM
14 years 11 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
EMNLP
2009
14 years 7 months ago
Discovery of Term Variation in Japanese Web Search Queries
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 ...
Hisami Suzuki, Xiao Li, Jianfeng Gao
DAGSTUHL
1993
14 years 11 months ago
Syntax and Semantics of Hybrid Database Languages
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...
Marc Andries, Gregor Engels
PODC
2009
ACM
15 years 10 months ago
Brief announcement: self-assembly as graph grammar as distributed system
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...
Aaron Sterling