Sciweavers

10 search results - page 1 / 2
» Coalgebraic Description of Generalized Binary Methods
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
13 years 4 months ago
Coalgebraic Description of Generalized Binary Methods
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
Furio Honsell, Marina Lenisa, Rekha Redamalla
ENTCS
2002
99views more  ENTCS 2002»
13 years 4 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews
ISIPTA
1999
IEEE
13 years 8 months ago
Implicative Analysis for Multivariate Binary Data using an Imprecise Dirichlet Model
Bayesian implicative analysis was proposed for summarizing the association in a 22 contingency table in terms possibly asymmetrical such as, e.g., presence of feature a implies, i...
Jean-Marc Bernard
EACL
2003
ACL Anthology
13 years 5 months ago
AVM Description Compilation using Types as Modes
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
Gerald Penn
ICIP
1995
IEEE
14 years 6 months ago
Variable resolution Markov modelling of signal data for image compression
Traditionally, Markov models have not been successfully used for compression of signal data other than binary image data. Due to the fact that exact substring matches in non-binar...
Mark Trumbo, Jacques Vaisey