Sciweavers

662 search results - page 125 / 133
» Computing the Temporal Structure of Events in Natural Langua...
Sort
View
104
Voted
POPL
1994
ACM
15 years 4 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
82
Voted
FLAIRS
2004
15 years 1 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
104
Voted
PPOPP
1997
ACM
15 years 4 months ago
Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
Beng-Hong Lim, Chi-Chao Chang, Grzegorz Czajkowski...
EACL
2006
ACL Anthology
15 years 1 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
101
Voted
JSYML
2010
107views more  JSYML 2010»
14 years 11 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov