Sciweavers

1728 search results - page 223 / 346
» The Size of Power Automata
Sort
View
COLING
2010
15 years 1 months ago
Expressing OWL axioms by English sentences: dubious in theory, feasible in practice
With OWL (Web Ontology Language) established as a standard for encoding ontologies on the Semantic Web, interest has begun to focus on the task of verbalising OWL code in controll...
Richard Power, Allan Third
JCT
2010
85views more  JCT 2010»
15 years 1 months ago
Symmetric bilinear forms over finite fields of even characteristic
Let Sm be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of Sm is called an (m, d)-set if the difference of...
Kai-Uwe Schmidt
JMLR
2010
111views more  JMLR 2010»
15 years 1 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
JSYML
2010
89views more  JSYML 2010»
15 years 1 months ago
The consistency strength of choiceless failures of SCH
We determine exact consistency strengths for various failures of the Singular Cardinals Hypothesis (SCH) in the setting of the Zermelo-Fraenkel axiom system ZF without the Axiom o...
Arthur W. Apter, Peter Koepke
TNN
2010
216views Management» more  TNN 2010»
15 years 1 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok