Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Haramaty, Elad"'
Autor:
Fetahu, Besnik, Cohen, Nachshon, Haramaty, Elad, Lewin-Eytan, Liane, Rokhlenko, Oleg, Malmasi, Shervin
Voice assistants have become ubiquitous in smart devices allowing users to instantly access information via voice questions. While extensive research has been conducted in question answering for voice search, little attention has been paid on how to
Externí odkaz:
http://arxiv.org/abs/2404.06017
Autor:
Bavarian, Mohammad, Ghazi, Badih, Haramaty, Elad, Kamath, Pritish, Rivest, Ronald L., Sudan, Madhu
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:
http://arxiv.org/abs/1612.01041
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:
http://arxiv.org/abs/1507.04330
An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first show that
Externí odkaz:
http://arxiv.org/abs/1312.4863
Autor:
Haramaty, Elad, Sudan, Madhu
We consider the task of compression of information when the source of the information and the destination do not agree on the prior, i.e., the distribution from which the information is being generated. This setting was considered previously by Kalai
Externí odkaz:
http://arxiv.org/abs/1211.5718
Autor:
Haramaty, Elad, Shpilka, Amir
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for degree three o
Externí odkaz:
http://arxiv.org/abs/0908.2853
The problem of constructing error-resilient interactive protocols was introduced in the seminal works of Schulman (FOCS 1992, STOC 1993). These works show how to convert any two-party interactive protocol into one that is resilient to constant-fracti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6befe79f2e33ea0fd798a36d2b562382
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Motivated by an attempt to understand the formation and development of (human) language, we introduce a "distributed compression" problem. In our problem a sequence of pairs of players from a set of K players are chosen and tasked to communicate mess
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::333aebdcd445e0b6d86945bd1622e00c
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.