Sciweavers

2887 search results - page 137 / 578
» Name Generation and Linearity
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
FSTTCS
2006
Springer
15 years 10 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
LREC
2010
165views Education» more  LREC 2010»
15 years 8 months ago
Maximum Entropy Classifier Ensembling using Genetic Algorithm for NER in Bengali
In this paper, we propose classifier ensemble selection for Named Entity Recognition (NER) as a single objective optimization problem. Thereafter, we develop a method based on gen...
Asif Ekbal, Sriparna Saha
ECEASST
2008
171views more  ECEASST 2008»
15 years 6 months ago
Type Checking C++ Template Instantiation by Graph Programs
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
Karl Azab, Karl-Heinz Pennemann
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
15 years 12 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...