155 search results - page 6 / 31 » The Problem with Noise and Small Disjuncts |
IJCAI
1989
14 years 10 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
102
Voted
DAGSTUHL
2007
14 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Effective reduction of noise is generally difficult because of the possible tight coupling of noise with high-frequency image structure. The problem is worse under low-light cond...
78
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...