2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.IR2019★ 2 cited
Productization Challenges of Contextual Multi-Armed Bandits
David Abensur, Ivan Balashov, Shaked Bar +5
Contextual Multi-Armed Bandits is a well-known and accepted online optimization algorithm, that is used in many Web experiences to tailor content or presentation to users' traffic.…
cs.CR2010
Secure Multiparty Computation with Partial Fairness
Amos Beimel, Eran Omri, Ilan Orlov
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted…