• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • The Pennsylvania State University CiteSeerX Archives (839)
    • Laboratoire d'Informatique Gaspard-Monge (LIGM) (40)
    • Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM) (37)
    • Crochemore, Maxime (27)
    • BOLT BERANEK AND NEWMAN INC CAMBRIDGE MA (26)
    • CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE (19)
    • MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB (19)
    • FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO (18)
    • Inenaga, Shunsuke (18)
    • King‘s College London (17)
    •   more
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

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...116 Hits 1 – 20 of 2.304 1 Towards Parallel Algorithms for Abstract Dialectical Frameworks ... Hofer, Mathias. - : TU Wien, 2022 BASE Show details 2 Parkinson detection by analyzing speech signals ... Μαρτινοπούλου, Ευσταθία Ηρακλή. - : Aristotle University of Thessaloniki, 2022 BASE Show details 3 Ranked Enumeration of Join Queries with Projections ... Deep, Shaleen; Hu, Xiao; Koutris, Paraschos. - : arXiv, 2022 BASE Show details 4 A theoretical and experimental analysis of BWT variants for string collections ... Cenzato, Davide; Lipták, Zsuzsanna. - : arXiv, 2022 BASE Show details 5 String Rearrangement Inequalities and a Total Order Between Primitive Words ... Luo, Ruixi; Zhu, Taikun; Jin, Kai. - : arXiv, 2022 BASE Show details 6 Dynamic Suffix Array with Polylogarithmic Queries and Updates ... Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2022 BASE Show details 7 Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems ... Le Gall, François; Seddighin, Saeed. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022 Abstract: Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds. Our results shed light on a very surprising fact: Although the classic solutions for LCS and LPS are almost identical (via suffix trees), their quantum computational complexities are different. While we give an exact Õ(√n) time algorithm for LPS, we prove that LCS needs at least time ̃ Ω(n^{2/3}) even for 0/1 strings. ... : LIPIcs, Vol. 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), pages 97:1-97:23 ... Keyword: Longest common substring; Longest palindrome substring; Quantum algorithms; Sublinear algorithms; Theory of computation → Design and analysis of algorithms URL: https://drops.dagstuhl.de/opus/volltexte/2022/15693/ https://dx.doi.org/10.4230/lipics.itcs.2022.97 BASE Hide details 8 An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ... Nishimoto, Takaaki; Kanda, Shunsuke; Tabei, Yasuo. - : arXiv, 2022 BASE Show details 9 An Unsupervised Approach to Structuring and Analyzing Repetitive Semantic Structures in Free Text of Electronic Medical Records Varvara Koshman; Anastasia Funkner; Sergey Kovalchuk In: Journal of Personalized Medicine; Volume 12; Issue 1; Pages: 25 (2022) BASE Show details 10 Optimal Fuzzy Controller Design for Autonomous Robot Path Tracking Using Population-Based Metaheuristics Alejandra Mancilla; Mario García-Valdez; Oscar Castillo; Juan Julian Merelo-Guervós In: Symmetry; Volume 14; Issue 2; Pages: 202 (2022) BASE Show details 11 Methods, Models and Tools for Improving the Quality of Textual Annotations Maria Teresa Artese; Isabella Gagliardi In: Modelling; Volume 3; Issue 2; Pages: 224-242 (2022) BASE Show details 12 Undecidability and Complexity for Super-Turing Models of Computation Eugene Eberbach In: Proceedings; Volume 81; Issue 1; Pages: 123 (2022) BASE Show details 13 Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ... Leonard, Laurentius; Tanaka, Ken. - : arXiv, 2022 BASE Show details 14 Reduction ratio of the IS-algorithm: worst and random cases ... Jugé, Vincent. - : arXiv, 2022 BASE Show details 15 Optimal Fuzzy Controller Design for Autonomous Robot Path Tracking Using Population-Based Metaheuristics Mancilla, Alejandra; Merelo Guervos, Juan Julián. - : MDPI, 2022 BASE Show details 16 Computation, Rule Following, and Ethics in AIs Seo, Hyunjin; Thorson, Stuart. - 2022 BASE Show details 17 Design and development of a lead free piezoelectric energy harvester for wideband, low frequency and low amplitude vibrations Kumari, Neetu; Rakotondrabe, Micky In: Micromachines ; https://hal.archives-ouvertes.fr/hal-03549337 ; Micromachines, 2021, 12 (12), pp.1537 (2021) BASE Show details 18 Distinct signatures of subjective confidence and objective accuracy in speech prosody Goupil, Louise; Aucouturier, Jean-Julien In: ISSN: 0010-0277 ; EISSN: 1873-7838 ; Cognition ; https://hal.sorbonne-universite.fr/hal-03263512 ; Cognition, Elsevier, 2021, 212, pp.104661. ⟨10.1016/j.cognition.2021.104661⟩ (2021) BASE Show details 19 E.W. Dijkstra, 1959, A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, p. 269271 Version bilingue et commentée Dijkstra, Edsger,; Beauguitte, Laurent; MAISONOBE, Marion In: https://hal.archives-ouvertes.fr/hal-03171590 ; 2021 (2021) BASE Show details 20 Critical Digital Humanities: texts, code and algorithms Laghi, Roberto In: Humanités numériques dans et sur les Amériques ; https://hal.archives-ouvertes.fr/hal-03373785 ; Humanités numériques dans et sur les Amériques, Apr 2021, Avignon, France (2021) BASE Show details Page: 1 2 3 4 5...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