DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5 6 7...116
Hits 41 – 60 of 2.304

41
Space-Efficient Huffman Codes Revisited ...
BASE
Show details
42
A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals ...
Motroi, Valeriu; Ciobaca, Stefan. - : arXiv, 2021
BASE
Show details
43
Absent Subsequences in Words ...
BASE
Show details
44
Lexicographically Fair Learning: Algorithms and Generalization ...
BASE
Show details
45
Near-Optimal Quantum Algorithms for String Problems ...
Akmal, Shyan; Jin, Ce. - : arXiv, 2021
Abstract: We study quantum algorithms for several fundamental string problems, including Longest Common Substring, Lexicographically Minimal String Rotation, and Longest Square Substring. These problems have been widely studied in the stringology literature since the 1970s, and are known to be solvable by near-linear time classical algorithms. In this work, we give quantum algorithms for these problems with near-optimal query complexities and time complexities. Specifically, we show that: - Longest Common Substring can be solved by a quantum algorithm in $\tilde O(n^{2/3})$ time, improving upon the recent $\tilde O(n^{5/6})$-time algorithm by Le Gall and Seddighin (2020). Our algorithm uses the MNRS quantum walk framework, together with a careful combination of string synchronizing sets (Kempa and Kociumaka, 2019) and generalized difference covers. - Lexicographically Minimal String Rotation can be solved by a quantum algorithm in $n^{1/2 + o(1)}$ time, improving upon the recent $\tilde O(n^{3/4})$-time algorithm by ... : To appear in SODA 2022. Fixed cleveref issues ...
Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences; FOS Physical sciences; Quantum Physics quant-ph
URL: https://arxiv.org/abs/2110.09696
https://dx.doi.org/10.48550/arxiv.2110.09696
BASE
Hide details
46
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
Amir, Amihood; Boneh, Itai. - : arXiv, 2021
BASE
Show details
47
The Labeled Direct Product Optimally Solves String Problems on Graphs ...
BASE
Show details
48
Weighted Ancestors in Suffix Trees Revisited ...
BASE
Show details
49
Load-Balancing Succinct B Trees ...
I, Tomohiro; Köppl, Dominik. - : arXiv, 2021
BASE
Show details
50
Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ...
Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2021
BASE
Show details
51
Grammar Index By Induced Suffix Sorting ...
BASE
Show details
52
Constructing Strings Avoiding Forbidden Substrings ...
Bernardini, Giulia; Marchetti-Spaccamela, Alberto; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
53
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns ...
BASE
Show details
54
Lyndon Words Accelerate Suffix Sorting ...
Bertram, Nico; Ellert, Jonas; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
55
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space ...
BASE
Show details
56
Faster Algorithms for Longest Common Substring ...
BASE
Show details
57
Detecting Signal Corruptions in Voice Recordings for Speech Therapy ; Igenkänning av Signalproblem i Röstinspelningar för Logopedi
Nylén, Helmer. - : KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021
BASE
Show details
58
Eliciting Auxiliary Information for Cold Start User Recommendation: A Survey
In: Applied Sciences ; Volume 11 ; Issue 20 (2021)
BASE
Show details
59
Authorship Attribution of Social Media and Literary Russian-Language Texts Using Machine Learning Methods and Feature Selection
In: Future Internet; Volume 14; Issue 1; Pages: 4 (2021)
BASE
Show details
60
New AI lexicon : labour ; Why AI needs ethics from below
Posada, Julian. - 2021
BASE
Show details

Page: 1 2 3 4 5 6 7...116

Catalogues
0
0
0
0
0
0
1
Bibliographies
0
0
0
0
0
0
0
0
8
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
2.295
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern