7 search results - page 1 / 2 » Exact Learning of Discretized Geometric Concepts |
SIAMCOMP
1998
13 years 4 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
EXACT
2009
13 years 2 months ago
2009
This paper addresses the issue of the explanation of the result given to the end-user by a classifier, when it is used as a decision support system. We consider machine learning cl...
INFORMATICALT
2006
13 years 4 months ago
2006
In this paper, a digital watermarking algorithm for copyright protection based on the concept of embed digital watermark and modifying frequency coefficients in discrete wavelet tr...