3250 search results - page 114 / 650 » Parameterized Learning Complexity |
117
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The sample complexity of active learning under the realizability assumption has been well-studied. The realizability assumption, however, rarely holds in practice. In this paper, ...
109
Voted
TIT
1998
15 years 2 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we consider the problem of recovering the
spatial layout of indoor scenes from monocular images. The
presence of clutter is a major problem for existing singleview...
104
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Congealing is a flexible nonparametric data-driven framework for the joint alignment of data. It has been successfully applied to the joint alignment of binary images of digits, ...
120
click to vote
ISVC
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a new method for projecting a mesh model of a source object onto a surface of an arbitrary target object. A deformable model, called Self-organizing Deformable ...