11231 search results - page 382 / 2247 » Digging for Data Structures |
213
click to vote
JMLR
2010
15 years 1 months ago
2010
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
238
click to vote
TNN
2010
15 years 1 months ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
189
click to vote
TSP
2010
15 years 1 months ago
2010
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
148
click to vote
ICMCS
2006
IEEE
16 years 25 days ago
2006
IEEE
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
196
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...