Sciweavers

115 search results - page 21 / 23
» Markov Chain Monte Carlo Estimation of Exponential Random Gr...
Sort
View
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
NECO
2007
129views more  NECO 2007»
13 years 7 months ago
Variational Bayes Solution of Linear Neural Networks and Its Generalization Performance
It is well-known that, in unidentifiable models, the Bayes estimation provides much better generalization performance than the maximum likelihood (ML) estimation. However, its ac...
Shinichi Nakajima, Sumio Watanabe
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 7 months ago
On the long time behavior of the TCP window size process
The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process t...
Djalil Chafaï, Florent Malrieu, Katy Paroux
ECCV
2002
Springer
14 years 9 months ago
Hyperdynamics Importance Sampling
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Cristian Sminchisescu, Bill Triggs
CVPR
1999
IEEE
13 years 11 months ago
A New Bayesian Framework for Object Recognition
We introduce an approach to feature-based object recognition, using maximum a posteriori (MAP) estimation under a Markov random field (MRF) model. This approach provides an effici...
Yuri Boykov, Daniel P. Huttenlocher