Zobrazeno 1 - 10
of 194
pro vyhledávání: '"Das, Debarati"'
Autor:
Das, Debarati, De Langis, Karin, Martin-Boyle, Anna, Kim, Jaehyung, Lee, Minhwa, Kim, Zae Myung, Hayati, Shirley Anugrah, Owan, Risako, Hu, Bin, Parkar, Ritik, Koo, Ryan, Park, Jonginn, Tyagi, Aahan, Ferland, Libby, Roy, Sanjali, Liu, Vincent, Kang, Dongyeop
This work delves into the expanding role of large language models (LLMs) in generating artificial data. LLMs are increasingly employed to create a variety of outputs, including annotations, preferences, instruction prompts, simulated dialogues, and f
Externí odkaz:
http://arxiv.org/abs/2401.14698
Our research integrates graph data with Large Language Models (LLMs), which, despite their advancements in various fields using large text corpora, face limitations in encoding entire graphs due to context size constraints. This paper introduces a ne
Externí odkaz:
http://arxiv.org/abs/2311.09862
Autor:
Cohen-Addad, Vincent1 cohenaddad@google.com, Das, Debarati2 debaratix710@gmail.com, Kipouridis, Evangelos2 kipouridis@di.ku.dk, Parotsidis, Nikos3 nikosp@google.com, Thorup, Mikkel2 mikkel2thorup@gmail.com
Publikováno v:
Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-41. 41p.
Text style transfer is an exciting task within the field of natural language generation that is often plagued by the need for high-quality paired datasets. Furthermore, training a model for multi-attribute text style transfer requires datasets with s
Externí odkaz:
http://arxiv.org/abs/2305.15582
Given two strings of length $n$ over alphabet $\Sigma$, and an upper bound $k$ on their edit distance, the algorithm of Myers (Algorithmica'86) and Landau and Vishkin (JCSS'88) computes the unweighted string edit distance in $\mathcal{O}(n+k^2)$ time
Externí odkaz:
http://arxiv.org/abs/2302.04229
We study the classical metric $k$-median clustering problem over a set of input rankings (i.e., permutations), which has myriad applications, from social-choice theory to web search and databases. A folklore algorithm provides a $2$-approximate solut
Externí odkaz:
http://arxiv.org/abs/2212.01821
Autor:
Das, Debarati, Gilbert, Jacob, Hajiaghayi, MohammadTaghi, Kociumaka, Tomasz, Saha, Barna, Saleh, Hamed
Computing the edit distance of two strings is one of the most basic problems in computer science and combinatorial optimization. Tree edit distance is a natural generalization of edit distance in which the task is to compute a measure of dissimilarit
Externí odkaz:
http://arxiv.org/abs/2209.07524
Publikováno v:
In Journal of Molecular Structure 5 September 2024 1311
The Dyck language, which consists of well-balanced sequences of parentheses, is one of the most fundamental context-free languages. The Dyck edit distance quantifies the number of edits (character insertions, deletions, and substitutions) required to
Externí odkaz:
http://arxiv.org/abs/2112.05866