Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Orgad Keller"'
Publikováno v:
Transactions of the Association for Computational Linguistics, Vol 11, Pp 351-366 (2023)
AbstractMost work on modeling the conversation history in Conversational Question Answering (CQA) reports a single main result on a common CQA benchmark. While existing models show impressive results on CQA leaderboards, it remains unclear whether th
Externí odkaz:
https://doaj.org/article/726b0fbd48a4409c8db18ebe71a289d9
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:5768-5778
Given the ubiquity of negative campaigning in recent political elections, we find it important to study its properties from a computational perspective. To this end, we present a model where elections can be manipulated by convincing voters to demote
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b3c40819e7709161ae9ec72708a8b33
https://doi.org/10.1609/aaai.v35i6.16723
https://doi.org/10.1609/aaai.v35i6.16723
Most works on modeling the conversation history in Conversational Question Answering (CQA) report a single main result on a common CQA benchmark. While existing models show impressive results on CQA leaderboards, it remains unclear whether they are r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a5dafc2e25effc952018021020d6e67
Publikováno v:
Journal of Artificial Intelligence Research. 64:109-145
We study the problem of coalitional manipulation---where k manipulators try to manipulate an election on m candidates---for any scoring rule, with focus on the Borda protocol. We do so in both the weighted and unweighted settings. For these problems,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb89ede8a013cce0ca3354003f525600
https://doi.org/10.1613/jair.1.11335
https://doi.org/10.1613/jair.1.11335
Autor:
Asaf Revach, Yossi Matias, Gal Elidan, Sayali Kulkarni, Sagie Pudinsky, Avinatan Hassidim, Michael Fink, Deborah Cohen, Shimi Salant, Orgad Keller, Eran O. Ofek, Idan Szpektor
Publikováno v:
WWW
We study conversational domain exploration (CODEX), where the user’s goal is to enrich her knowledge of a given domain by conversing with an informative bot. Such conversations should be well grounded in high-quality domain knowledge as well as eng
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac26a21c2cbf28e4b403c8c05c0e5787
https://doi.org/10.1145/3366423.3380167
https://doi.org/10.1145/3366423.3380167
Publikováno v:
EMNLP (Findings)
Sentence fusion is the task of joining related sentences into coherent text. Current training and evaluation schemes for this task are based on single reference ground-truths and do not account for valid fusion variants. We show that this hinders mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99ff215879d0978a4af3b3c21bfb3e85
Publikováno v:
Journal of Artificial Intelligence Research. 66
The classic Bribery problem is to find a minimal subset of voters who need to change their vote to make some preferred candidate win. Its important generalizations consider voters who are weighted and also have different prices. We provide an approxi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd3e109796d91692ba6226f53eb7a571
https://doi.org/10.1613/jair.1.11538
https://doi.org/10.1613/jair.1.11538
Publikováno v:
Theoretical Computer Science. 525:42-54
In substring compression one is given a text to preprocess so that, upon request, a compressed substring is returned. Generalized substring compression is the same with the following twist. The queries contain an additional context substring (or a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9712000f5fbbee8904980f5e131366c
https://doi.org/10.1016/j.tcs.2013.10.010
https://doi.org/10.1016/j.tcs.2013.10.010
Publikováno v:
Theoretical Computer Science. 412:3537-3544
A string S@?@S^m can be viewed as a set of pairs {(s"i,i)|s"i@?S,i@?{0,...,m-1}}. We follow the recent work on pattern matching with address errors and consider approximate pattern matching problems arising from the setting where errors are introduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::294a0d0a4e24806c8357f734e3790656
https://doi.org/10.1016/j.tcs.2011.02.044
https://doi.org/10.1016/j.tcs.2011.02.044
Publikováno v:
Theoretical Computer Science. 410:5347-5353
The well-known problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)-time solvable and is a classical distance measure for strings. Another well-studied string comparison measure is that of paramete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::999d48848b30d3832c8131ecab9a312e
https://doi.org/10.1016/j.tcs.2009.09.011
https://doi.org/10.1016/j.tcs.2009.09.011