Sciweavers

198 search results - page 6 / 40
» Infinite mixtures of trees
Sort
View
CSL
2006
Springer
14 years 10 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
CSR
2009
Springer
15 years 2 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
ACL
1997
14 years 11 months ago
Mistake-Driven Mixture of Hierarchical Tag Context Trees
This paper proposes a mistake-driven mixture method for learning a tag model. The method iteratively performs two proce
Masahiko Haruno, Yuji Matsumoto
85
Voted
KDD
2004
ACM
237views Data Mining» more  KDD 2004»
15 years 10 months ago
Bayesian Model-Averaging in Unsupervised Learning From Microarray Data
Unsupervised identification of patterns in microarray data has been a productive approach to uncovering relationships between genes and the biological process in which they are in...
Mario Medvedovic, Junhai Guo