Sciweavers

1120 search results - page 98 / 224
» Eager Markov Chains
Sort
View
ACL
1994
15 years 7 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
CVIU
2006
162views more  CVIU 2006»
15 years 6 months ago
Unsupervised scene analysis: A hidden Markov model approach
This paper presents a new approach to scene analysis, which aims at extracting structured information from a video sequence using directly low-level data. The method models the se...
Manuele Bicego, Marco Cristani, Vittorio Murino
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 6 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
UAI
2000
15 years 7 months ago
Minimum Message Length Clustering Using Gibbs Sampling
The K-Means and EM algorithms are popular in clustering and mixture modeling due to their simplicity and ease of implementation. However, they have several significant limitations...
Ian Davidson
ISOLA
2010
Springer
15 years 4 months ago
Ten Years of Performance Evaluation for Concurrent Systems Using CADP
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
Nicolas Coste, Hubert Garavel, Holger Hermanns, Fr...