• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (2.300)
    • Print (4)
  • 
    Type:
    
    • Article (1.961)
    • Miscellaneous (249)
    • Book (94)
  • 
    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. - : arXiv, 2021 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 ... 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 Abstract: There cannot be “fairness” in Artificial Intelligence (AI) without ensuring that fair work principles are respected. “Transparency” cannot be achieved when hundreds of workers are excluded and silenced. AI cannot be “responsible” without caring for the livelihoods of the people in developing countries who make this technology possible. Protecting workers and their communities, their rights, and their perspectives on the technologies that they help create remain essential steps to justice and co-liberation in artificial intelligence development. In one of the introduction posts for the platform workers for a major tech company, one of the frequently asked questions included “I got a task asking for something illegal. What do I do?” Keyword: ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIAS; BUILT-IN BIAS; DIGITIZATION; ETHICS; EXPLOITATION; GLOBAL; HUMAN RIGHTS VIOLATIONS; LABOUR MARKET; LEGAL FRAMEWORK; MACHINE LEARNING; POVERTY; PRECARIOUS EMPLOYMENT; PRIVACY PROTECTION; RECORDS KEEPING; SURVEILLANCE; VENEZUELA URL: http://hdl.handle.net/10625/61006 BASE Hide 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