Sciweavers

1139 search results - page 22 / 228
» Bounded Ideation Theory
Sort
View
JMLR
2006
105views more  JMLR 2006»
13 years 7 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
MLQ
2008
54views more  MLQ 2008»
13 years 7 months ago
A localic theory of lower and upper integrals
An account of lower and upper integration is given. It is constructive in the sense of geometric logic. If the integrand takes its values in the nonnegative lower reals, then its ...
Steven Vickers
AAAI
2008
13 years 10 months ago
A Theory of Expressiveness in Mechanisms
A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness ...
Michael Benisch, Norman M. Sadeh, Tuomas Sandholm
DCC
2006
IEEE
14 years 7 months ago
Asymptotic Nonlinearity of Boolean Functions
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
François Rodier
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 7 months ago
Nowhere dense graph classes, stability, and the independence property
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
Hans Adler, Isolde Adler