| 1 |
Emotional Speech Recognition Using Deep Neural Networks
|
|
|
|
In: ISSN: 1424-8220 ; Sensors ; https://hal.archives-ouvertes.fr/hal-03632853 ; Sensors, MDPI, 2022, 22 (4), pp.1414. ⟨10.3390/s22041414⟩ (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Towards combined semantic and lexical scores based on a new representation of textual data to extract experimental data from scientific publications
|
|
|
|
In: ISSN: 1751-5858 ; EISSN: 1751-5866 ; International Journal of Intelligent Information and Database Systems ; https://hal.inrae.fr/hal-03616243 ; International Journal of Intelligent Information and Database Systems, Inderscience, 2022, 15 (1), pp.78. ⟨10.1504/IJIIDS.2022.120146⟩ (2022)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Islands and Bridges of Language: Bio-Inspired Structural Analysis of Language Embedding Data
|
|
|
|
BASE
|
|
Show details
|
|
|
| 6 |
TIPD : Taiwan Indigenous Peoples open research Data 台灣原住民基礎開放研究資料庫 ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 7 |
FAIRsharing record for: Document management -- Electronic document file format for long-term preservation -- Part 1: Use of PDF 1.4 (PDF/A-1) ... : ISO 19005-1:2005 ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 8 |
FAIRsharing record for: Systems to manage terminology, knowledge and content -- Design, implementation and maintenance of terminology management systems ... : ISO 26162:2012 ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 9 |
FAIRsharing record for: General Ontology for Linguistic Description ... : GOLD ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 10 |
FAIRsharing record for: Information technology -- Hypermedia/Time-based Structuring Language (HyTime) ... : ISO/IEC 10744:1997 ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 11 |
FAIRsharing record for: Language resource management -- Feature structures -- Part 1: Feature structure representation ... : ISO 24610-1:2006 ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk)
|
|
Boker, Udi. - : LIPIcs - Leibniz International Proceedings in Informatics. 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), 2022
|
|
Abstract:
There is a challenging trade-off between deterministic and nondeterministic automata, where the former suit various applications better, however at the cost of being exponentially larger or even less expressive. This gave birth to many notions in between determinism and nondeterminism, aiming at enjoying, sometimes, the best of both worlds. Some of the notions are yes/no ones, for example initial nondeterminism (restricting nondeterminism to allowing several initial states), and some provide a measure of nondeterminism, for example the ambiguity level. We analyze the possible generalization of such notions from Boolean to quantitative automata, and suggest that it depends on the following key characteristics of the considered notion ? - whether it is syntactic or semantic, and if semantic, whether it is word-based or language-based. A syntactic notion, such as initial nondeterminism, applies as is to a quantitative automaton A, namely ?(A). A word-based semantic notion, such as unambiguity, applies as is to a Boolean automaton t-A that is derived from A by accompanying it with some threshold value t ? ?, namely ?(t-A). A language-based notion, such as history determinism, also applies as is to t-A, while in addition, it naturally generalizes into two different notions with respect to A itself, by either: i) taking the supremum of ?(t-A) over all thresholds t, denoted by Threshold-?(A); or ii) generalizing the basis of the notion from a language to a function, denoted simply by ?(A). While in general ?(A) ? Threshold-?(A) ? ?(t-A), we have for some notions ?(A) ? Threshold-?(A), and for some not. (For measure notions, ? stands for ? with respect to the nondeterminism level.) We classify numerous notions known in the Boolean setting according to their characterization above, generalize them to the quantitative setting and look into relations between them. The generalized notions open new research directions with respect to quantitative automata, and provide insights on the original notions with respect to Boolean automata.
|
|
Keyword:
Data processing Computer science; Determinism; Measure of Nondeterminism; Quantitative Automata
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2022/15721/
https://doi.org/10.4230/LIPIcs.CSL.2022.1
https://nbn-resolving.org/urn:nbn:de:0030-drops-157218
|
|
BASE
|
|
Hide details
|
|
|
| 14 |
Open access dataset of task-free hemodynamic activity in 4-month-old infants during sleep using fNIRS ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Corpus of Political Speeches: Policy responses to the Great Recession in the United Kingdom and Spain (2008-2014) ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Conditional Adversarial Learning to Enhance Bot Detection ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 17 |
Dialectics of Liberation Congress Digital Archive Audio File Project ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Dialectics of Liberation Congress Digital Archive Audio File Project ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 19 |
Protocol for the development of the international population registry for aphasia after stroke (I-PRAISE)
|
|
|
|
In: Research outputs 2014 to 2021 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Utilising a systematic review-based approach to create a database of individual participant data for meta- and network meta-analyses: The RELEASE database of aphasia after stroke
|
|
|
|
In: Research outputs 2014 to 2021 (2022)
|
|
BASE
|
|
Show details
|
|
|
|
|
