Yaron Fairstein

According to our database, Yaron Fairstein authored at least 15 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Extremely efficient online query encoding for dense retrieval.

Nachshon Cohen, Yaron Fairstein, Guy Kushilevitz

Proceedings of the Findings of the Association for Computational Linguistics: NAACL 2024, 2024

Evaluating D-MERIT of Partial-annotation on Information Retrieval.

Royi Rassin, Yaron Fairstein, Oren Kalinsky, Guy Kushilevitz, Nachshon Cohen, Alexander Libov, Yoav Goldberg

Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, 2024

InDi: Informative and Diverse Sampling for Dense Retrieval.

Nachshon Cohen, Hedda Cohen Indelman, Yaron Fairstein, Guy Kushilevitz

Proceedings of the Advances in Information Retrieval, 2024

Distributional Online Weighted Paging with Limited Horizon.

Yaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor

Proceedings of the Approximation, 2024

2022

Dynamicity and Multi-Commodity in Networks.

Yaron Fairstein

PhD thesis, 2022

An almost optimal approximation algorithm for monotone submodular multiple knapsack.

Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai

J. Comput. Syst. Sci., 2022

External Evaluation of Ranking Models under Extreme Position-Bias.

Yaron Fairstein, Elad Haramaty, Arnon Lazerson, Liane Lewin-Eytan

Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

2021

Online Virtual Machine Allocation with Lifetime and Load Predictions.

Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor

Proceedings of the SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2021

Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping.

Yaron Fairstein, Ariel Kulik, Hadas Shachnai

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

General Knapsack Problems in a Dynamic Setting.

Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz

Proceedings of the Approximation, 2021

2020

Online Virtual Machine Allocation with Predictions.

Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor

CoRR, 2020

tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints.

Yaron Fairstein, Ariel Kulik, Hadas Shachnai

CoRR, 2020

A (1-e^-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.

Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

NFV Placement in Resource-Scarce Edge Nodes.

Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz

Proceedings of the 20th IEEE/ACM International Symposium on Cluster, 2020

2018

Algorithms for Dynamic NFV Workload.

Yaron Fairstein, Seffi Naor, Danny Raz

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018