Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Learning binary perceptrons perfectly efficiently.

From MaRDI portal
Publication:960477
Jump to:navigation, search

DOI10.1006/JCSS.1996.0028zbMath1152.68497OpenAlexW2093094821MaRDI QIDQ960477

Santosh S. Venkatesh, Shao C. Fang

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5317298635a0ed2d22e1060c4390a15e6c34c0d1


zbMATH Keywords

perceptronmajority rule algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)


Related Items (1)

Covering cubes by random half cubes, with applications to binary neural networks







This page was built for publication: Learning binary perceptrons perfectly efficiently.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:960477&oldid=12942870"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 19:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki