495 search results - page 62 / 99 » Sparse representation algorithms based on mean-field approxi... |
119
Voted
JMLR
2010
14 years 7 months ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
116
Voted
ICCV
2011
IEEE
14 years 17 days ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
87
Voted
ICIAR
2005
Springer
15 years 6 months ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
101
click to vote
JMLR
2006
15 years 15 days ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
135
click to vote
ICMLA
2008
15 years 2 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...