52 search results - page 7 / 11 » A comparison of tight generalization error bounds |
JMLR
2002
14 years 10 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
JC
2006
14 years 11 months ago
2006
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
81
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
116
click to vote
EUROCODE
1990
15 years 3 months ago
1990
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
97
Voted
IPPS
2008
IEEE
15 years 5 months ago
2008
IEEE
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...