Sciweavers

1465 search results - page 6 / 293
» Making the Correct Mistakes
Sort
View
COLT
1993
Springer
15 years 1 months ago
Learning Binary Relations Using Weighted Majority Voting
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
Sally A. Goldman, Manfred K. Warmuth
MM
2009
ACM
111views Multimedia» more  MM 2009»
15 years 2 months ago
Integrating corrections into digital ink playback
In this paper, we describe preliminary work on an ink editing application that allows an instructor to correct mistakes to digital ink written during a presentation that is to be ...
Richard J. Anderson, Devy Pranowo, Craig Prince, F...
ICMLA
2007
14 years 11 months ago
Memory-based context-sensitive spelling correction at web scale
We study the problem of correcting spelling mistakes in text using memory-based learning techniques and a very large database of token n-gram occurrences in web text as training d...
Andrew Carlson, Ian Fette
ICDAR
2007
IEEE
15 years 3 months ago
Context-Sensitive Error Correction: Using Topic Models to Improve OCR
Modern optical character recognition software relies on human interaction to correct misrecognized characters. Even though the software often reliably identifies low-confidence ...
Michael L. Wick, Michael G. Ross, Erik G. Learned-...
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 1 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer