Sciweavers

14158 search results - page 106 / 2832
» Generalized switch-setting problems
Sort
View
ICML
1997
IEEE
14 years 11 months ago
Characterizing the generalization performance of model selection strategies
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
Dale Schuurmans, Lyle H. Ungar, Dean P. Foster
DATE
2003
IEEE
108views Hardware» more  DATE 2003»
14 years 3 months ago
Generalized Posynomial Performance Modeling
This paper presents a new method to automatically generate posynomial symbolic expressions for the performance characteristics of analog integrated circuits. The coefficient set ...
Tom Eeckelaert, Walter Daems, Georges G. E. Gielen...
ACSAC
2001
IEEE
14 years 1 months ago
Requirements for a General Framework for Response to Distributed Denial-of-Service
What is network denial of service (DoS), and why is it such a problem? This research project has sought to investigate these questions and look at the deeper questions such as can...
D. W. Gresty, Qi Shi, Madjid Merabti
DM
2008
123views more  DM 2008»
13 years 10 months ago
Graphic sequences with a realization containing a generalized friendship graph
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
Jian-Hua Yin, Gang Chen, John R. Schmitt
DM
2007
63views more  DM 2007»
13 years 10 months ago
On Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
George E. Andrews, James A. Sellers