Sciweavers

10 search results - page 2 / 2
» Minimum Message Length and Kolmogorov Complexity
Sort
View
AMAI
2004
Springer
13 years 11 months ago
Bayesian Model Averaging Across Model Spaces via Compact Encoding
Bayesian Model Averaging (BMA) is well known for improving predictive accuracy by averaging inferences over all models in the model space. However, Markov chain Monte Carlo (MCMC)...
Ke Yin, Ian Davidson
IJCAI
1997
13 years 7 months ago
A Study of Causal Discovery With Weak Links and Small Samples
Weak causal relationships and small sample size pose two significant difficulties to the automatic discovery of causal models from observational data. This paper examines the infl...
Honghua Dai, Kevin B. Korb, Chris S. Wallace, Xind...
CAI
2010
Springer
13 years 19 days ago
A Comparison of Decision Tree Classifiers for Automatic Diagnosis of Speech Recognition Errors
Present speech recognition systems are becoming more complex due to technology advances, optimizations and special requirements such as small computation and memory footprints. Pro...
Milos Cernak
TIP
2010
119views more  TIP 2010»
13 years 10 days ago
Trajectory Classification Using Switched Dynamical Hidden Markov Models
This paper proposes an approach for recognizing human activities (more specifically, pedestrian trajectories) in video sequences, in a surveillance context. A system for automatic ...
Jacinto C. Nascimento, Mário A. T. Figueire...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami