DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5...10
Hits 1 – 20 of 200

1
Transforming Sequence Tagging Into A Seq2Seq Task ...
BASE
Show details
2
Metamorphic Thinking in Cartesian Systemic Emergence
In: proc. of ICONS 2021 -The Sixteenth International Conference on Systems (ISBN: 978-1-61208-838-9) ; ICONS 2021 ; https://hal.archives-ouvertes.fr/hal-03321417 ; ICONS 2021, IARIA, Apr 2021, Porto, Portugal. pp.33-38 ; https://www.iaria.org/conferences2021/ICONS21.html (2021)
BASE
Show details
3
An examination of reading, reading development and disorder in a highly transparent orthography: the case of Turkish
Raman, Evren Hussein. - : Brunel University London, 2021
BASE
Show details
4
Jettisoning Junk Messaging in the Era of End-to-End Encryption: A Case Study of WhatsApp ...
BASE
Show details
5
WIT: Wikipedia-based Image Text Dataset for Multimodal Multilingual Machine Learning ...
BASE
Show details
6
Learning Contextualized Knowledge Structures for Commonsense Reasoning ...
BASE
Show details
7
Weighted Ancestors in Suffix Trees Revisited ...
BASE
Show details
8
Weighted Ancestors in Suffix Trees Revisited ...
Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.; Raman, Rajeev. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
Abstract: The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require Ω(log log n) time for queries provided 𝒪(n polylog n) space is available and weights are from [0..n], where n is the number of tree nodes. However, when applied to suffix trees, the problem, surprisingly, admits an 𝒪(n)-space solution with constant query time, as was shown by Gawrychowski, Lewenstein, and Nicholson (Proc. ESA 2014). This variant of the problem can be reformulated as follows: given the suffix tree of a string s, we need a data structure that can locate in the tree any substring s[p..q] of s in 𝒪(1) time (as if one descended from the root reading s[p..q] along the way). Unfortunately, the data structure of Gawrychowski et al. has no efficient construction algorithm, limiting its wider usage as an algorithmic tool. In this paper we resolve this issue, describing a data structure for weighted ancestors in suffix trees with constant query time and a linear construction ... : LIPIcs, Vol. 191, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), pages 8:1-8:15 ...
Keyword: deterministic substring hashing; irreducible LCP; suffix tree; Theory of computation → Pattern matching; weighted ancestors
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13959/
https://dx.doi.org/10.4230/lipics.cpm.2021.8
BASE
Hide details
9
Designing and Implementing a Novel Virtual Rounds Curriculum for Medical Students' Internal Medicine Clerkship During the COVID-19 Pandemic
In: MedEdPORTAL (2021)
BASE
Show details
10
“Watch Me Grow- Electronic (WMG-E)” surveillance approach to identify and address child development, parental mental health, and psychosocial needs: study protocol
In: BMC Health Serv Res (2021)
BASE
Show details
11
Adoption of online proctored examinations by university students during COVID-19: Innovation diffusion study
In: Educ Inf Technol (Dordr) (2021)
BASE
Show details
12
Towards Humanizing Online Discourse - Exploring Linguistic and Emotional Tones in Online Learning
Raman, Preeti. - : University of Toronto, 2021
BASE
Show details
13
Genealogies of Transnational Religion: Translation, Revelation, and Discursive Technologies in Two Female Gurus of Esoteric Vedanta
Kuchuk, Nika. - : University of Toronto, 2021
BASE
Show details
14
“Watch Me Grow- Electronic (WMG-E)” surveillance approach to identify and address child development, parental mental health, and psychosocial needs: study protocol
BASE
Show details
15
"Watch Me Grow- Electronic (WMG-E)" surveillance approach to identify and address child development, parental mental health, and psychosocial needs : study protocol
Eapen, Valsamma; Woolfenden, Susan; Schmied, Virginia (R11439). - : U.K., BioMed Central, 2021
BASE
Show details
16
Gesellschaftskritik und Parodie in der "Känguru-Trilogie" von Marc-Uwe Kling
Goswami, Raman Kumar [Verfasser]. - München : GRIN Verlag, 2020
DNB Subject Category Language
Show details
17
Gesellschaftskritik und Parodie in der "Känguru-Trilogie" von Marc-Uwe Kling
Goswami, Raman Kumar [Verfasser]. - München : GRIN Verlag, 2020
DNB Subject Category Language
Show details
18
Spinning a yarn across languages: adapting MAIN for India
Raman, Madhavi Gayathri [Verfasser]; Madappa, Manish [Verfasser]; Gurung, Yozna [Verfasser]. - Frankfurt am Main : Universitätsbibliothek Johann Christian Senckenberg, 2020
DNB Subject Category Language
Show details
19
Measurement of single-diffractive dijet production in proton-proton collisions at $\sqrt{s} =$ 8 TeV with the CMS and TOTEM experiments
In: Eur.Phys.J.C ; https://hal.archives-ouvertes.fr/hal-02507664 ; Eur.Phys.J.C, 2020, 80 (12), pp.1164. ⟨10.1140/epjc/s10052-020-08562-y⟩ (2020)
BASE
Show details
20
Spinning a yarn across languages: adapting MAIN for India
In: Gagarina, Natalʹja Vladimirovna. New language versions of MAIN: Multilingual Assessment Instrument for Narratives - revised. - Berlin : Leibniz-Zentrum Allgemeine Sprachwissenschaft (ZAS) (2020), 107-116
UB Frankfurt Linguistik
Show details

Page: 1 2 3 4 5...10

Catalogues
5
0
14
0
7
2
0
Bibliographies
15
0
0
1
0
0
0
1
6
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
154
1
1
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern