Sciweavers

417 search results - page 12 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
KR
2004
Springer
14 years 1 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
14 years 2 months ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
DSN
2009
IEEE
13 years 11 months ago
Sharing end-user negative symptoms for improving overlay network dependability
The dependability of overlay services rely on the overlay network’s capabilities to effectively diagnose and recover faults (e.g., link failures, overlay node outages). However,...
Yongning Tang, Ehab Al-Shaer
TLCA
2001
Springer
14 years 26 days ago
The Implicit Calculus of Constructions
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an i...
Alexandre Miquel
EMNLP
2009
13 years 6 months ago
Unbounded Dependency Recovery for Parser Evaluation
This paper introduces a new parser evaluation corpus containing around 700 sentences annotated with unbounded dependencies, from seven different grammatical constructions. We run ...
Laura Rimell, Stephen Clark, Mark Steedman