26 search results - page 2 / 6 » Why are DBNs sparse |
MST
2010
13 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
—In this paper we investigate the local probability density function (pdf) of natural signals in sparse domains. The statistical properties of natural signals are characterized m...
ICRA
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...
NIPS
2003
13 years 6 months ago
2003
Recently, relevance vector machines (RVM) have been fashioned from a sparse Bayesian learning (SBL) framework to perform supervised learning using a weight prior that encourages s...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...