324 search results - page 7 / 65 » Bounds for Functions of Dependent Risks |
EUROCRYPT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
ICSE
1999
IEEE-ACM
15 years 1 months ago
1999
IEEE-ACM
Abstract. Polymorphism is a key feature of the objectoriented paradigm. However, polymorphism induces hidden forms of class dependencies, which may impact software quality. In this...
87
Voted
ML
2007
ACM
14 years 9 months ago
2007
ACM
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
NIPS
2001
14 years 11 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
82
Voted
DAGSTUHL
2008
14 years 11 months ago
2008
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...