1547 search results - page 46 / 310 » Solving Knapsack Problems in a Sticker Based Model |
DAGSTUHL
2007
13 years 9 months ago
2007
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
JDCTA
2010
13 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
AGI
2008
13 years 9 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...