Sciweavers

3134 search results - page 48 / 627
» Computing full disjunctions
Sort
View
UAI
1993
13 years 11 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
JVA
2006
IEEE
14 years 3 months ago
Natural Deduction Calculus for Computation Tree Logic
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
SIBGRAPI
2006
IEEE
14 years 3 months ago
A Computer-Assisted Colorization Algorithm based on Topological Difference
Region-based approaches to cel painting typically use shape similarity and topology relations between regions of consecutive animation frames. This paper presents a new colorizati...
Hedlena M. de A. Bezerra, Bruno Feijó, Luiz...
CLIN
2000
13 years 11 months ago
Alpino: Wide-coverage Computational Analysis of Dutch
Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexic...
Gosse Bouma, Gertjan van Noord, Rob Malouf
CPHYSICS
2011
279views Education» more  CPHYSICS 2011»
13 years 1 months ago
CAMORRA: A C++ library for recursive computation of particle scattering amplitudes
We present a new Monte Carlo tool that computes full tree-level matrix elements in high-energy physics. The program accepts user-defined models and has no restrictions on the pro...
R. Kleiss, G. van den Oord