16430 search results - page 450 / 3286 » On Computable Tree Functions |
146
click to vote
ASIAN
2003
Springer
16 years 4 days ago
2003
Springer
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
192
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
153
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Object tracking algorithms extensively found in literature are either constrained with assumptions or are overly sensitive to noise. We propose and successfully test two new weigh...
160
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...
155
click to vote
ICNS
2008
IEEE
16 years 1 months ago
2008
IEEE
The paper presents an analysis of the possibilities of defining penalty functions to be used in SLA management frameworks. As a basis for the analysis, a brief survey of metrics u...