417 search results - page 74 / 84 » Some Theory for Generalized Boosting Algorithms |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Mechanism design (MD) has recently become a very popular approach in the design of distributed systems of autonomous agents. A key assumption required for the application of MD is...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
PODS
2011
ACM
12 years 10 months ago
2011
ACM
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...