Sciweavers

2570 search results - page 321 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
136
Voted
NIPS
2003
15 years 5 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
103
Voted
CSDA
2007
172views more  CSDA 2007»
15 years 3 months ago
AMCMC: An R interface for adaptive MCMC
We describe AMCMC, a software package for running adaptive MCMC algorithms on user-supplied density functions. AMCMC provides the user with an R interface, which in turn calls C pr...
Jeffrey S. Rosenthal
105
Voted
TIT
2008
61views more  TIT 2008»
15 years 3 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano
138
Voted
ICCV
2007
IEEE
16 years 5 months ago
Differential EMD Tracking
Illumination changes cause object appearance to change drastically and many existing tracking algorithms lack the capability to handle this problem. The Earth Mover's Distanc...
Qi Zhao, Shane Brennan, Hai Tao
ICASSP
2008
IEEE
15 years 10 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...