Sciweavers

1029 search results - page 8 / 206
» Probabilistic Recurrence Relations
Sort
View
DM
2007
113views more  DM 2007»
13 years 7 months ago
Counting labeled general cubic graphs
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
COLING
2002
13 years 7 months ago
Determining Recurrent Sound Correspondences by Inducing Translation Models
I present a novel approach to the determination of recurrent sound correspondences in bilingual wordlists. The idea is to relate correspondences between sounds in wordlists to tra...
Grzegorz Kondrak
AI50
2006
13 years 11 months ago
Dynamical Systems in the Sensorimotor Loop: On the Interrelation Between Internal and External Mechanisms of Evolved Robot Behav
This case study demonstrates how the synthesis and the analysis of minimal recurrent neural robot control provide insights into the exploration of embodiment. By using structural e...
Martin Hülse, Steffen Wischmann, Poramate Man...
ECML
2007
Springer
14 years 1 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
JAT
2007
67views more  JAT 2007»
13 years 7 months ago
Rakhmanov's theorem for orthogonal matrix polynomials on the unit circle
Rakhmanov’s theorem for orthogonal polynomials on the unit circle gives a sufficient condition on the orthogonality measure for orthogonal polynomials on the unit circle, in orde...
Walter Van Assche