Sciweavers

5499 search results - page 218 / 1100
» Generalized Rewrite Theories
Sort
View
LDTA
2010
15 years 7 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
ENTCS
2008
96views more  ENTCS 2008»
15 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
ENTCS
2006
135views more  ENTCS 2006»
15 years 7 months ago
Coordination Models Based on a Formal Model of Distributed Object Reflection
We propose a family of models of coordination of distributed object systems representing different views, with refinement relations between the different views. We start with dist...
Carolyn L. Talcott
SIGIR
2008
ACM
15 years 7 months ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...
SIGIR
2008
ACM
15 years 7 months ago
Generating diverse katakana variants based on phonemic mapping
In Japanese, it is quite common for the same word to be written in several different ways. This is especially true for katakana words which are typically used for transliterating ...
Kazuhiro Seki, Hiroyuki Hattori, Kuniaki Uehara