Sciweavers

101 search results - page 5 / 21
» Quotient Types: A Modular Approach
Sort
View
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
13 years 11 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
EACL
1993
ACL Anthology
13 years 9 months ago
Type-Driven Semantic Interpretation of f-Structures
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...
Jürgen Wedekind, Ronald M. Kaplan
NN
2006
Springer
114views Neural Networks» more  NN 2006»
13 years 7 months ago
Modular learning models in forecasting natural phenomena
Modular model is a particular type of committee machine and is comprised of a set of specialized (local) models each of which is responsible for a particular region of the input s...
Dimitri P. Solomatine, Michael Baskara L. A. Siek
COLING
1996
13 years 9 months ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger
AAMAS
2005
Springer
13 years 7 months ago
Modular Representation of Agent Interaction Rules through Argumentation
Communication between agents needs to be flexible enough to encompass together a variety of different aspects such as, conformance to society protocols, private tactics of the indi...
Antonis C. Kakas, Nicolas Maudet, Pavlos Moraitis