Zobrazeno 1 - 10
of 18 712
pro vyhledávání: '"Golan, A"'
Autor:
Gafni, Yotam, Golan, Ben
Perpetual voting studies fair collective decision-making in settings where many decisions are to be made, and is a natural framework for settings such as parliaments and the running of blockchain Decentralized Autonomous Organizations (DAOs). We focu
Externí odkaz:
http://arxiv.org/abs/2408.08767
We analyze the Bass and SI models for the spreading of innovations and epidemics, respectively, on homogeneous complete networks, circular networks, and heterogeneous complete networks with two homogeneous groups. We allow the network parameters to b
Externí odkaz:
http://arxiv.org/abs/2407.10816
Autor:
Rubchinsky, Maxim, Rabinovich, Ella, Shraibman, Adi, Golan, Netanel, Sahar, Tali, Shweiki, Dorit
We present a novel approach to automating the identification of risk factors for diseases from medical literature, leveraging pre-trained models in the bio-medical domain, while tuning them for the specific task. Faced with the challenges of the dive
Externí odkaz:
http://arxiv.org/abs/2407.07373
In this paper, we present and study the \emph{Hamming distance oracle problem}. In this problem, the task is to preprocess two strings $S$ and $T$ of lengths $n$ and $m$, respectively, to obtain a data-structure that is able to answer queries regardi
Externí odkaz:
http://arxiv.org/abs/2407.05430
The recently introduced Consistency models pose an efficient alternative to diffusion algorithms, enabling rapid and good quality image synthesis. These methods overcome the slowness of diffusion models by directly mapping noise to data, while mainta
Externí odkaz:
http://arxiv.org/abs/2405.16260
A $\lambda$-cover of a string $S$ is a set of strings $\{C_i\}_1^\lambda$ such that every index in $S$ is contained in an occurrence of at least one string $C_i$. The existence of a $1$-cover defines a well-known class of quasi-periodic strings. Quas
Externí odkaz:
http://arxiv.org/abs/2405.11475
A decision maker repeatedly chooses one of a finite set of actions. In each period, the decision maker's payoff depends on fixed basic payoff of the chosen action and the frequency with which the action has been chosen in the past. We analyze optimal
Externí odkaz:
http://arxiv.org/abs/2405.00561
Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an operation applied to strings, particularly useful in DNA computing. Conceptually, a right hairpin completion operation transforms a string $S$ into $S\cdot S'$
Externí odkaz:
http://arxiv.org/abs/2404.11673
Autor:
Wu, Zelin, Song, Gan, Li, Christopher, Rondon, Pat, Meng, Zhong, Velez, Xavier, Wang, Weiran, Caseiro, Diamantino, Pundak, Golan, Munkhdalai, Tsendsuren, Chandorkar, Angad, Prabhavalkar, Rohit
Publikováno v:
2024 Annual Conference of the North American Chapter of the Association for Computational Linguistics - Industry Track
Contextual biasing enables speech recognizers to transcribe important phrases in the speaker's context, such as contact names, even if they are rare in, or absent from, the training data. Attention-based biasing is a leading approach which allows for
Externí odkaz:
http://arxiv.org/abs/2404.10180
We are given a bounded Borel-measurable real-valued function on a product of countably many Polish spaces, and a product probability measure. We are interested in points in the product space that can be used to approximate the expected value of this
Externí odkaz:
http://arxiv.org/abs/2404.07028