Sciweavers

11160 search results - page 81 / 2232
» Incompleteness in a General Setting
Sort
View
IJCAI
2007
13 years 11 months ago
From Answer Set Logic Programming to Circumscription via Logic of GK
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
Fangzhen Lin, Yi Zhou
IJCAI
1993
13 years 11 months ago
Generalization of the Dempster-Shafer Theory
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
J. W. Guan, David A. Bell
COLT
2003
Springer
14 years 3 months ago
A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
Amy R. Greenwald, Amir Jafari
COLT
2001
Springer
14 years 2 months ago
Geometric Bounds for Generalization in Boosting
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
Shie Mannor, Ron Meir
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 10 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang