Sciweavers

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

8

FOCS
1996
IEEE

favoriteEmaildiscussreport

72views Theoretical Computer Science» more FOCS 1996»

A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions

13 years 9 months ago

A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions

Download www.math.cmu.edu

Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh V

Real-time Traffic

FOCS 1996 | Theoretical Computer Science |

claim paper

Related Content

» Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents

» New Algorithms for Learning in Presence of Errors

» Learning Intersections and Thresholds of Halfspaces

» Regret Bounds for Hierarchical Classification with LinearThreshold Functions

» DistributionIndependent Evolvability of Linear Threshold Functions

» On PAC Learning Using Winnow Perceptron and a Perceptronlike Algorithm

» WorstCase Analysis of Selective Sampling for LinearThreshold Algorithms

» Policy teaching through reward function learning

» DualBounded Generating Problems Partial and Multiple Transversals of a Hypergraph

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1996
Where	FOCS
Authors	Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala

Comments (0)