Sciweavers

178 search results - page 23 / 36
» Maximum likelihood of phylogenetic networks
Sort
View
JMLR
2006
118views more  JMLR 2006»
14 years 11 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
97
Voted
CISS
2008
IEEE
15 years 6 months ago
Distributed detection in the presence of frequency offset and phase shift
— In this paper, we study the problem of distributed detection in the presence of unknown carrier frequency offset (CFO) and initial phase, the issue we encounter in the emerging...
Tao Wu, Qi Cheng
ECML
2006
Springer
15 years 3 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
IJCNN
2008
IEEE
15 years 6 months ago
A formula of equations of states in singular learning machines
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...
Sumio Watanabe
IPPS
2005
IEEE
15 years 5 months ago
Bioinformatics on a Heterogeneous Java Distributed System
A programmable Java distributed system, which utilises the free resources of a heterogeneous set of computers linked together by a network, has been developed. The system has been...
Andrew J. Page, Thomas M. Keane, Thomas J. Naughto...