We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
Background: Incorrectly annotated sequence data are becoming more commonplace as databases increasingly rely on automated techniques for annotation. Hence, there is an urgent need...
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Protein-protein interactions (PPI) play a key role in many biological systems. Over the past few years, an explosion in availability of functional biological data obtained from hi...
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...