11213 search results - page 63 / 2243 » Low-contention data structures |
148
click to vote
JMLR
2010
14 years 10 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...
173
Voted
TNN
2010
14 years 10 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...
130
Voted
TSP
2010
14 years 10 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...
145
Voted
ACL
2012
13 years 6 months ago
2012
This paper presents a novel sequence labeling model based on the latent-variable semiMarkov conditional random fields for jointly extracting argument roles of events from texts. ...
108
Voted
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...