Sciweavers

Share
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
10 years 2 months ago
Learning Monotone Decision Trees in Polynomial Time
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
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
10 years 4 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
books