Detection of focal impaired awareness seizures using a biometric shirt
Epilepsia Open, EarlyView.Abstract Objective In recent years, seizure detection using wearable technology has gained significant attention in research. Most studies, however, have focused on detecting generalized or focal to bilateral tonic–clonic seizures. This study evaluates the feasibility of using a biometric shirt to detect focal impaired awareness seizures (FIAS) by ...
Jérôme St‐Jean +6 more
wiley +1 more source
Forecasting land-use and land-cover change for groundwater sustainability in the Muvattupuzha basin using CA-Markov (2033-2050). [PDF]
Sci RepK A +4 more
europepmc +1 more source
Speech-based computational approaches for classification and symptom monitoring in schizophrenia spectrum disorders: a systematic review and meta-analysis. [PDF]
BMC PsychiatryNaeim M, Narimani M, Aghajani S.
europepmc +1 more source
Machine learning approach for optimizing usability of healthcare websites. [PDF]
Sci RepKaur A, Singh J, Kaur S.
europepmc +1 more source
Related searches:
Sequentiality of Group-Weighted Tree Automata
Lecture Notes in Computer Science, 2021We introduce the notion of group-weighted tree automata over commutative groups and characterise sequentialisability of such automata. In particular, we introduce a fitting notion for tree distance and prove the equivalence between sequentialisability, the so-called Lipschitz property, and the so-called twinning property.
Frederic Dörband +2 more
exaly +3 more sources
Approximated Determinisation of Weighted Tree Automata
Lecture Notes in Computer Science, 2021We introduce the notion of t-approximated determinisation and the t-twinning property of weighted tree automata (\(\mathrm {WTA}\)) over the tropical semiring. We provide an algorithm that accomplishes t-approximated determinisation of an input automaton \(\mathscr {A}\), whenever it terminates.
Frederic Dörband +2 more
exaly +3 more sources
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Information and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luisa Herrmann
exaly +3 more sources
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Pech
exaly +4 more sources
On Finite and Polynomial Ambiguity of Weighted Tree Automata
Lecture Notes in Computer Science, 2016We consider finite and polynomial ambiguity of weighted tree automata. Concerning finite ambiguity, we show that a finitely ambiguous weighted tree automaton can be decomposed into a sum of unambiguous automata. For polynomial ambiguity, we show how to decompose a polynomially ambiguous weighted tree automaton into simpler polynomially ambiguous ...
Erik Paul
exaly +3 more sources
Ambiguity Hierarchies for Weighted Tree Automata
International Journal of Foundations of Computer Science, 2023Weighted tree automata (WTA) extend classical weighted automata (WA) to the non-linear structure of trees. The expressive power of WA with varying degrees of ambiguity has been extensively studied. Unambiguous, finitely ambiguous, and polynomially ambiguous WA over the tropical (as well as the arctic) semiring strictly increase in expressive power ...
A. Maletti +3 more
semanticscholar +2 more sources