Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
114
click to vote
APPROX
2009
Springer
129
views
Algorithms
»
more
APPROX 2009
»
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
15 years 9 months ago
Download
www.phillong.info
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
Adam R. Klivans, Philip M. Long, Alex K. Tang
claim paper
Read More »