Sciweavers

650 search results - page 116 / 130
» On Coalgebras over Algebras
Sort
View
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 10 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
CORR
2004
Springer
142views Education» more  CORR 2004»
14 years 10 months ago
Modeling and Validating Hybrid Systems Using VDM and Mathematica
Hybrid systems are characterized by the hybrid evolution of their state: A part of the state changes discretely, the other part changes continuously over time. Typically, modern c...
Bernhard K. Aichernig, Reinhold Kainhofer
JCB
1998
105views more  JCB 1998»
14 years 10 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
MST
1998
76views more  MST 1998»
14 years 10 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
IJAR
2010
113views more  IJAR 2010»
14 years 8 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...