2520 search results - page 121 / 504 » The complexity of approximating entropy |
AGI
2008
14 years 12 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
69
Voted
NIPS
2000
14 years 11 months ago
2000
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
85
Voted
WCE
2007
14 years 11 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
122
click to vote
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
SIGGRAPH
1992
ACM
15 years 2 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...