Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FOCS
1995
IEEE

favoriteEmaildiscussreport

77views Theoretical Computer Science» more FOCS 1995»

Learning Polynomials with Queries: The Highly Noisy Case

13 years 8 months ago

Learning Polynomials with Queries: The Highly Noisy Case

Download people.csail.mit.edu

Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan

Real-time Traffic

FOCS 1995 | Theoretical Computer Science |

claim paper

Related Content

» Online Learning of Noisy Data with Kernels

» Reconstructing phylogenies from noisy quartets in polynomial time with a high success prob...

» Noisy Interpolation of Sparse Polynomials and Applications

» Uniform Characterizations of PolynomialQuery Learnabilities

» On the Privacy of Web Search Based on Query Obfuscation A Case Study of TrackMeNot

» Total Recall Automatic Query Expansion with a Generative Feature Model for Object Retrieva...

» Efficient and ErrorCorrecting Data Structures for Membership and Polynomial Evaluation

» Cotraining with Noisy Perceptual Observations

» On polynomialtime preference elicitation with value queries

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	FOCS
Authors	Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan

Comments (0)