• Refine your search:
  • 
    Keyword:
    
    • ALGORITHMS (496)
    • Algorithms (430)
    • Linguistics (351)
    • FOS Computer and information sciences (248)
    • Data Structures and Algorithms cs.DS (222)
    • Experimentation (210)
    • Computer Programming and Software (175)
    • [INFO.INFO-DS]Computer Science [cs] / Data Structures and Algorithms [cs.DS] (147)
    • Design (140)
    • Performance (134)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (2.304)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 3 4 5 6 7...116 Hits 41 – 60 of 2.304 41 Space-Efficient Huffman Codes Revisited ... Grabowski, Szymon; Köppl, Dominik. - : arXiv, 2021 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 ... Kosche, Maria; Koß, Tore; Manea, Florin. - : arXiv, 2021 BASE Show details 44 Lexicographically Fair Learning: Algorithms and Generalization ... Diana, Emily; Gill, Wesley; Globus-Harris, Ira. - : arXiv, 2021 BASE Show details 45 Near-Optimal Quantum Algorithms for String Problems ... Akmal, Shyan; Jin, Ce. - : arXiv, 2021 BASE Show 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 ... Rizzo, Nicola; Tomescu, Alexandru I.; Policriti, Alberto. - : arXiv, 2021 BASE Show details 48 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : arXiv, 2021 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 ... Akagi, Tooru; Köppl, Dominik; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki. - : arXiv, 2021 Abstract: Pattern matching is the most central task for text indices. Most recent indices leverage compression techniques to make pattern matching feasible for massive but highly-compressible datasets. Within this kind of indices, we propose a new compressed text index built upon a grammar compression based on induced suffix sorting [Nunes et al., DCC'18]. We show that this grammar exhibits a locality sensitive parsing property, which allows us to specify, given a pattern $P$, certain substrings of $P$, called cores, that are similarly parsed in the text grammar whenever these occurrences are extensible to occurrences of $P$. Supported by the cores, given a pattern of length $m$, we can locate all its $occ$ occurrences in a text $T$ of length $n$ within $O(m \lg |\mathcal{S}| + occ_C \lg|\mathcal{S}| \lg n + occ)$ time, where $\mathcal{S}$ is the set of all characters and non-terminals, $occ$ is the number of occurrences, and $occ_C$ is the number of occurrences of a chosen core $C$ of $P$ in the right hand side of ... : Our implementation is available at https://github.com/TooruAkagi/GCIS_Index ... Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences URL: https://arxiv.org/abs/2105.13744 https://dx.doi.org/10.48550/arxiv.2105.13744 BASE Hide 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 ... Deng, Jin Jie; Hon, Wing-Kai; Köppl, Dominik. - : arXiv, 2021 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 ... Kosolobov, Dmitry; Sivukhin, Nikita. - : arXiv, 2021 BASE Show details 56 Faster Algorithms for Longest Common Substring ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : arXiv, 2021 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 Nor Aniza Abdullah; Rasheed Abubakar Rasheed; Mohd Hairul Nizam... 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 Anastasia Fedotova; Aleksandr Romanov; Anna Kurtukova; Alexander Shelupanov 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

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 1 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 8 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 2.295 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0