Sciweavers

14158 search results - page 483 / 2832
» Generalized switch-setting problems
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 6 months ago
A Formal Measure of Machine Intelligence
A fundamental problem in artificial intelligence is that nobody really knows what intelligence is. The problem is especially acute when we need to consider artificial systems whic...
Shane Legg, Marcus Hutter
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 6 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
ICIP
2003
IEEE
16 years 8 months ago
Sparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
Morten Nielsen, Rémi Gribonval
207
Voted
ICML
2007
IEEE
16 years 7 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...