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
2
search results - page 1 / 1
»
Minimizing the Average Query Complexity of Learning Monotone...
Sort
relevance
views
votes
recent
update
View
thumb
title
83
Voted
INFORMS
2002
56
views
more
INFORMS 2002
»
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
15 years 2 months ago
Download
arrowsmith.psych.uic.edu
Vetle I. Torvik, Evangelos Triantaphyllou
claim paper
Read More »
139
Voted
COCO
2006
Springer
118
views
Algorithms
»
more
COCO 2006
»
Learning Monotone Decision Trees in Polynomial Time
15 years 6 months ago
Download
www1.cs.columbia.edu
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »