( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithms for distributional and adversarial pipelined filter ordering problems.

, , , и . ACM Trans. Algorithms, 5 (2): 24:1-24:34 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gaëlle Lisack

Oleg Lisagor

Hamel Lisa

Jacob Lisakafu

Tautvydas Lisauskas

 

Другие публикации лиц с тем же именем

Complexity Theoretic Hardness Results for Query Learning., , , и . Comput. Complex., 7 (1): 19-53 (1998)Revisiting the Approximation Bound for Stochastic Submodular Cover., и . J. Artif. Intell. Res., (2018)Exact learning of DNF formulas using DNF hypotheses., и . STOC, стр. 465-473. ACM, (2002)Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games., , и . Operations Research, 67 (3): 731-743 (2019)Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover, , и . CoRR, (2013)Why skewing works: learning difficult Boolean functions with greedy tree learners., , , и . ICML, том 119 из ACM International Conference Proceeding Series, стр. 728-735. ACM, (2005)Algorithms for distributional and adversarial pipelined filter ordering problems., , , и . ACM Trans. Algorithms, 5 (2): 24:1-24:34 (2009)Tight Bounds on Proper Equivalence Query Learning of DNF., , , и . COLT, том 23 из JMLR Proceedings, стр. 31.1-31.18. JMLR.org, (2012)Coding Techniques for Handling Failures in Large Disk Arrays., , , , и . Algorithmica, 12 (2/3): 182-208 (1994)A Polyhedral Approach to Some Max-min Problems., и . CoRR, (2021)