2957 search results - page 231 / 592 » The Complexity of Polynomial-Time Approximation |
219
click to vote
AAAI
2010
15 years 8 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
187
click to vote
AGI
2008
15 years 8 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...
143
click to vote
NIPS
2000
15 years 8 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...
166
click to vote
WCE
2007
15 years 7 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...
215
click to vote
ICASSP
2011
IEEE
14 years 10 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...