Sciweavers

4541 search results - page 533 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Learning Deep Boltzmann Machines using Adaptive MCMC
When modeling high-dimensional richly structured data, it is often the case that the distribution defined by the Deep Boltzmann Machine (DBM) has a rough energy landscape with man...
Ruslan Salakhutdinov
TCS
2008
15 years 7 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
NECO
1998
119views more  NECO 1998»
15 years 6 months ago
Density Estimation by Mixture Models with Smoothing Priors
In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the ce...
Akio Utsugi
JACM
2010
208views more  JACM 2010»
15 years 5 months ago
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
ICASSP
2011
IEEE
14 years 10 months ago
Parallel computation of adaptive lattice filters
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Dong-hwan Lee, Wonyong Sung