Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Khalighinejad, Ghazal"'
Autor:
Butoi, Alexandra, Khalighinejad, Ghazal, Svete, Anej, Valvoda, Josef, Cotterell, Ryan, DuSell, Brian
Characterizing the computational power of neural network architectures in terms of formal language theory remains a crucial line of research, as it describes lower and upper bounds on the reasoning capabilities of modern AI. However, when empirically
Externí odkaz:
http://arxiv.org/abs/2411.07107
Autor:
Khalighinejad, Ghazal, Scott, Sharon, Liu, Ollie, Anderson, Kelly L., Stureborg, Rickard, Tyagi, Aman, Dhingra, Bhuwan
Multimodal information extraction (MIE) is crucial for scientific literature, where valuable data is often spread across text, figures, and tables. In materials science, extracting structured information from research articles can accelerate the disc
Externí odkaz:
http://arxiv.org/abs/2410.20494
Autor:
Fu, Deqing, Guo, Ruohao, Khalighinejad, Ghazal, Liu, Ollie, Dhingra, Bhuwan, Yogatama, Dani, Jia, Robin, Neiswanger, Willie
Current foundation models exhibit impressive capabilities when prompted either with text only or with both image and text inputs. But do their capabilities change depending on the input modality? In this work, we propose $\textbf{IsoBench}$, a benchm
Externí odkaz:
http://arxiv.org/abs/2404.01266
This paper investigates the use of large language models (LLMs) for extracting sample lists of polymer nanocomposites (PNCs) from full-length materials science research papers. The challenge lies in the complex nature of PNC samples, which have numer
Externí odkaz:
http://arxiv.org/abs/2403.00260
We investigate the ability of transformer models to approximate the CKY algorithm, using them to directly predict a sentence's parse and thus avoid the CKY algorithm's cubic dependence on sentence length. We find that on standard constituency parsing
Externí odkaz:
http://arxiv.org/abs/2305.02386
We study the impact of merging routines in merge-based sorting algorithms. More precisely, we focus on the galloping routine that TimSort uses to merge monotonic sub-arrays, hereafter called runs, and on the impact on the number of element comparison
Externí odkaz:
http://arxiv.org/abs/2012.03996
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.
We study the impact of sub-array merging routines on merge-based sorting algorithms. More precisely, we focus on the galloping sub-routine that TimSort uses to merge monotonic (non-decreasing) sub-arrays, hereafter called runs, and on the impact on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f7e6bca0afe7276e515afa59c7fe748
We study the impact of sub-array merging routines on merge-based sorting algorithms. More precisely, we focus on the galloping sub-routine that Timsort uses to merge monotonic (non-decreasing) sub-arrays, hereafter called runs, and on the impact on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c37257f64322030567fab33bc88c12c7