Sciweavers

52 search results - page 4 / 11
» Learning Polynomials with Queries: The Highly Noisy Case
Sort
View
ICALP
2011
Springer
12 years 11 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 12 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
KBS
1998
96views more  KBS 1998»
13 years 7 months ago
Case-based content navigation
This paper describes a document retrieval system called CAIRN that uses a case-based reasoning set using a large lexicon to automatically generate a case index to that document se...
Ian Watson, Heather Watson
DCG
2008
104views more  DCG 2008»
13 years 7 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
CVPR
2010
IEEE
14 years 3 months ago
Improving State-of-the-Art OCR through High-Precision Document-Specific Modeling
Optical character recognition (OCR) remains a difficult problem for noisy documents or documents not scanned at high resolution. Many current approaches rely on stored font models...
Andrew Kae, Gary Huang, Erik Learned-miller, Carl ...