Sciweavers

944 search results - page 48 / 189
» A Survey on Counting Networks
Sort
View
ICALT
2007
IEEE
15 years 6 months ago
Does interactivity with content enhance the quality of learning?
This paper describes the development of interactive electronic tool (etool) for learning Japanese Kanji (Chinese) characters; especially the stroke count and stroke order for writ...
Yasmin Bhattacharya, Madhumita Bhattacharya
RTA
2005
Springer
15 years 5 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
DM
1998
60views more  DM 1998»
14 years 11 months ago
On numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
Martin Klazar
RSA
2002
71views more  RSA 2002»
14 years 11 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
ECSQARU
2007
Springer
15 years 6 months ago
Logical Compilation of Bayesian Networks with Discrete Variables
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...
Michael Wachter, Rolf Haenni