Sciweavers

222 search results - page 36 / 45
» Representing dialogic argumentation
Sort
View
TLCA
2007
Springer
14 years 2 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
DSN
2005
IEEE
14 years 2 months ago
Assured Reconfiguration of Fail-Stop Systems
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...
Elisabeth A. Strunk, John C. Knight, M. Anthony Ai...
BIRTHDAY
2005
Springer
14 years 2 months ago
Objective Bayesian Nets
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
Jon Williamson
EDOC
2003
IEEE
14 years 1 months ago
MQL: a Powerful Extension to OCL for MOF Queries
The Meta-Object Facility (MOF) provides a standardised framework for object-oriented models. An instance of a MOF model contains objects and links whose interfaces are entirely de...
David Hearnden, Kerry Raymond, Jim Steel