Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Elad Haramaty"'
Publikováno v:
Theory of Computing. 16:1-18
In the "correlated sampling" problem, two players are given probability distributions $P$ and $Q$, respectively, over the same finite set, with access to shared randomness. Without any communication, the two players are each required to output an ele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::722496964812e369775e91d2920584b8
https://doi.org/10.4086/toc.2020.v016a012
https://doi.org/10.4086/toc.2020.v016a012
Publikováno v:
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::652a760902a6c47a659e1354ec6d06c6
https://doi.org/10.1145/3488560.3498420
https://doi.org/10.1145/3488560.3498420
Publikováno v:
WWW
Learning a ranking model in product search involves satisfying many requirements such as maximizing the relevance of retrieved products with respect to the user query, as well as maximizing the purchase likelihood of these products. Multi-Objective R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5286454c12bb5878470e8f048846b180
https://doi.org/10.1145/3366423.3380122
https://doi.org/10.1145/3366423.3380122
Publikováno v:
WSDM
One emerging benefit of voice assistants is to facilitate product search experience, allowing users to express orally which products they seek, and taking actions on retrieved results such as adding them to their cart or sending the product details t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa42cbeb015407b1bb0a6ed3e50545c6
https://doi.org/10.1145/3336191.3371780
https://doi.org/10.1145/3336191.3371780
Publikováno v:
SIAM Journal on Computing. 47:493-523
Let D be a b-wise independent distribution over {0,1}^m. Let E be the "noise" distribution over {0,1}^m where the bits are independent and each bit is 1 with probability eta/2. We study which tests f: {0,1}^m -> [-1,1] are epsilon-fooled by D+E, i.e.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ecdd039c1e8373d010ce9e29b196ef2
https://doi.org/10.1137/17m1129088
https://doi.org/10.1137/17m1129088
Autor:
Roy Schwartz, Moran Feldman, Tami Tamir, Hadas Shachnai, Ron Adany, Rohit Khandekar, Baruch Schieber, Elad Haramaty
Publikováno v:
ACM Transactions on Algorithms. 12:1-25
We study a variant of the generalized assignment problem ( gap ), which we label all-or-nothing gap ( agap ). We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ > 0, and utility a ℓ j ⩾ 0 if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::633023bac06deb19932837f2eb507f13
https://doi.org/10.1145/2843944
https://doi.org/10.1145/2843944
Publikováno v:
Theory of Computing. 11:299-338
In this work we present a strong analysis of the testability of a broad, and to date the most interesting known, class of “affine-invariant” codes. Affine-invariant codes are codes whose coordinates are associated with a vector space and are inva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2e58a100e1e506bb573f4a45fb2b730
https://doi.org/10.4086/toc.2015.v011a012
https://doi.org/10.4086/toc.2015.v011a012
Publikováno v:
FOCS
We consider the problem of testing if a given function $f : \F_q^n \right arrow \F_q$ is close to a $n$-variate degree $d$ polynomial over the finite field $\F_q$ of $q$elements. The natural, low-query, test for this property would be to pick the sma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16edefb37d4a0a720edf5e2980b2f63a
https://doi.org/10.1137/120879257
https://doi.org/10.1137/120879257
Publikováno v:
PODC
Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed computing. The local nature of an MIS allows for fast solutions in a static distributed setting, which are logarithmic in the number of nodes or in their degrees.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff2ab76c4ceb1d50cb3352a0e75a867
https://doi.org/10.1145/2933057.2933083
https://doi.org/10.1145/2933057.2933083
Publikováno v:
FOCS
A local tester for a code probabilistically views a small set of coordinates of a given word and based on this local view accepts code words with probability one while rejecting words far from the code with constant probability. A local tester for a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0020d22125351dc20d433368300ca3c
https://doi.org/10.1109/focs.2015.56
https://doi.org/10.1109/focs.2015.56