Sciweavers

3406 search results - page 91 / 682
» Computational models of classical conditioning
Sort
View
CAAN
2007
Springer
15 years 10 months ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 11 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICIP
2004
IEEE
16 years 5 months ago
Unsupervised motion detection using a markovian temporal model with global spatial constraints
In this work, we propose an unsupervised Bayesian model for the detection of moving objects from dynamic scenes. This unsupervised solution is a three-step approach that uses a st...
Pierre-Marc Jodoin, Max Mignotte
TIST
2011
136views more  TIST 2011»
14 years 11 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
JMLR
2012
13 years 6 months ago
Max-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...
Kevin Miller, M. Pawan Kumar, Benjamin Packer, Dan...