Sciweavers

1750 search results - page 100 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 5 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
IANDC
2006
78views more  IANDC 2006»
15 years 6 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
SLE
2009
Springer
16 years 15 days ago
Ontological Metamodeling with Explicit Instantiation
Model Driven Engineering (MDE) is a promising paradigm for development. It raises the level of abstraction in software development by treating models as primary artifacts. The prac...
Alfons Laarman, Ivan Kurtev
ACTA
2007
88views more  ACTA 2007»
15 years 6 months ago
Distributed Consensus, revisited
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
Rachele Fuzzati, Massimo Merro, Uwe Nestmann
DAGSTUHL
2006
15 years 7 months ago
System model for UML -- The interactions case
Previous works define the notion of system model, which provides a formal basis for the definition of the semantics of a distributed object-oriented modelling language. This articl...
María Victoria Cengarle