• Refine your search:
  • 
    Keyword:
    
    • pattern matching (53)
    • Linguistics (38)
    • MATCHING (35)
    • matching (33)
    • Matching (20)
    • Pattern matching (20)
    • Data processing Computer science (17)
    • ALGORITHMS (16)
    • Information Science (16)
    • Cybernetics (15)
    •   more
  • 
    Creator / Publisher
  • 
    Year:
    
    • 2022 (6)
    • 2021 (24)
    • 2020 (31)
    • 2019 (43)
    • 2018 (23)
    • 2017 (21)
    • 2016 (22)
    • 2015 (18)
    • 2014 (20)
    • 2013 (18)
    •   more
  • 
    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...31 Hits 1 – 20 of 605 1 LinkingPark: Automatic Semantic Table Interpretation Software ... Chen, Shuang; Karaoglu, Alperen; Negreanu, Carina. - : Zenodo, 2022 BASE Show details 2 LinkingPark: Automatic Semantic Table Interpretation Software ... Chen, Shuang; Karaoglu, Alperen; Negreanu, Carina. - : Zenodo, 2022 BASE Show details 3 3-D Sound Image Reproduction Method Based on Spherical Harmonic Expansion for 22.2 Multichannel Audio Kenta Iwai; Hiromu Suzuki; Takanobu Nishiura In: Applied Sciences; Volume 12; Issue 4; Pages: 1994 (2022) BASE Show details 4 A Deep Fusion Matching Network Semantic Reasoning Model Wenfeng Zheng; Yu Zhou; Shan Liu; Jiawei Tian; Bo Yang; Lirong Yin In: Applied Sciences; Volume 12; Issue 7; Pages: 3416 (2022) BASE Show details 5 An Impact Assessment of ESF Training Courses for Unemployed in the Province of Bolzano Pastore, Francesco; Pompili, Marco. - : Bonn: Institute of Labor Economics (IZA), 2022 BASE Show details 6 An impact assessment of ESF training courses for unemployed in the Province of Bolzano Pastore, Francesco; Pompili, Marco. - : Essen: Global Labor Organization (GLO), 2022 BASE Show details 7 An ERP investigation of transposed-word effects in same-different matching Pegado, Felipe; Wen, Yun; Mirault, Jonathan... In: ISSN: 0028-3932 ; EISSN: 1873-3514 ; Neuropsychologia ; https://hal-amu.archives-ouvertes.fr/hal-03226383 ; Neuropsychologia, Elsevier, 2021, 153, ⟨10.1016/j.neuropsychologia.2021.107753⟩ (2021) BASE Show details 8 Study of non-projective dependencies in French ; Étude des dépendances syntaxiques non projectives en français Perrier, Guy In: ISSN: 1248-9433 ; EISSN: 1965-0906 ; Revue TAL ; https://hal.inria.fr/hal-03389157 ; Revue TAL, ATALA (Association pour le Traitement Automatique des Langues), 2021, 62 (1) (2021) BASE Show details 9 Raising and matching in Pharasiot Greek relative clauses: a diachronic reconstruction Bağrıaçık, Metin; Danckaert, Lieven In: ISSN: 0022-2267 ; EISSN: 1469-7742 ; Journal of Linguistics ; https://hal.archives-ouvertes.fr/hal-03328119 ; Journal of Linguistics, Cambridge University Press (CUP), In press (2021) BASE Show details 10 Repetitions, Rest Insertion and Schwa in 16th Century French Polyphony: An Emergent Sub-Grammar in Fresneau's Songs? Premat, Timothée; Chouvion, Sophie; Verner, Axelle In: The Emergence of Grammars. A Closer Look at Dialects between Phonology and Morphosyntax. ; https://hal.archives-ouvertes.fr/hal-03353521 ; Michela Russo. The Emergence of Grammars. A Closer Look at Dialects between Phonology and Morphosyntax., Nova Sciences, 2021, 978-1-53619-888-1 ; https://novapublishers.com/shop/the-emergence-of-grammars-a-closer-look-at-dialects-between-phonology-and-morphosyntax/ (2021) BASE Show details 11 Language Style Matching in the Therapeutic Dyads of the Gloria Films: Rogers-Gloria, Perls-Gloria, and Ellis-Gloria ... Miranda, Roberta. - : Open Science Framework, 2021 BASE Show details 12 Probability matching across linguistic and non-linguistic domains ... Saldana, Carmen. - : Open Science Framework, 2021 BASE Show details 13 Claim Detection and Matching for Indian Languages ... Ashkan Kazemi; Garimella, Kiran; Gaffney, Devin. - : Zenodo, 2021 BASE Show details 14 Claim Detection and Matching for Indian Languages ... Ashkan Kazemi; Garimella, Kiran; Gaffney, Devin. - : Zenodo, 2021 BASE Show details 15 Domain-aware ontology matching ... Quesada Real, Francisco José. - : The University of Edinburgh, 2021 BASE Show details 16 Faster Algorithms for Longest Common Substring ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 17 A Compact Index for Cartesian Tree Matching ... Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 18 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 19 Constructing Strings Avoiding Forbidden Substrings ... Bernardini, Giulia; Marchetti-Spaccamela, Alberto; Pissis, Solon P.; Stougie, Leen; Sweering, Michelle. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 Abstract: We consider the problem of constructing strings over an alphabet Σ that start with a given prefix u, end with a given suffix v, and avoid occurrences of a given set of forbidden substrings. In the decision version of the problem, given a set S_k of forbidden substrings, each of length k, over Σ, we are asked to decide whether there exists a string x over Σ such that u is a prefix of x, v is a suffix of x, and no s ∈ S_k occurs in x. Our first result is an 𝒪(|u|+|v|+k|S_k|)-time algorithm to decide this problem. In the more general optimization version of the problem, given a set S of forbidden arbitrary-length substrings over Σ, we are asked to construct a shortest string x over Σ such that u is a prefix of x, v is a suffix of x, and no s ∈ S occurs in x. Our second result is an 𝒪(|u|+|v|+||S||⋅|Σ|)-time algorithm to solve this problem, where ||S|| denotes the total length of the elements of S. Interestingly, our results can be directly applied to solve the reachability and shortest path problems in complete ... : LIPIcs, Vol. 191, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), pages 9:1-9:18 ... Keyword: data sanitization; de Bruijn graphs; forbidden strings; string algorithms; Theory of computation → Pattern matching URL: https://drops.dagstuhl.de/opus/volltexte/2021/13960/ https://dx.doi.org/10.4230/lipics.cpm.2021.9 BASE Hide details 20 The k-Mappability Problem Revisited ... Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details Page: 1 2 3 4 5...31

Mobile view All Catalogues UB Frankfurt Linguistik 4 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) 2 Bibliographies BLLDB 3 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 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 598 Linguistik-Repository 1 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0