Sciweavers

4332 search results - page 627 / 867
» A Probabilistic Identification Result
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
JMLR
2010
145views more  JMLR 2010»
14 years 11 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
TNN
2010
174views Management» more  TNN 2010»
14 years 11 months ago
Equivalences between neural-autoregressive time series models and fuzzy systems
Soft computing (SC) emerged as an integrating framework for a number of techniques that could complement one another quite well (artificial neural networks, fuzzy systems, evolutio...
José Luis Aznarte, José Manuel Ben&i...
ICCV
2007
IEEE
16 years 6 months ago
Scene Modeling Using Co-Clustering
In this paper, we propose a novel approach for scene modeling. The proposed method is able to automatically discover the intermediate semantic concepts. We utilize Maximization of...
Jingen Liu, Mubarak Shah
ICASSP
2011
IEEE
14 years 8 months ago
Event classification for personal photo collections
People take more and more photos at different time and different events, however, these photos are often put into one giant folder and they are seldom annotated or organized. As t...
Feng Tang, Daniel Tretter, Chris Willis