1059 search results - page 70 / 212 » Improved Algorithms via Approximations of Probability Distri... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
PAMI
2011
14 years 4 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
The hierarchical Dirichlet process hidden Markov model (HDP-HMM) is a flexible, nonparametric model which allows state spaces of unknown size to be learned from data. We demonstra...