Results 11 to 20 of about 475,794 (375)
Chimerical Dataset Creation Protocol Based on Doddington Zoo: A Biometric Application with Face, Eye, and ECG [PDF]
Sensors, 2019 Multimodal systems are a workaround to enhance the robustness and effectiveness of biometric systems. A proper multimodal dataset is of the utmost importance to build such systems.
Pedro Lopes Silva +4 more
doaj +2 more sources
Decidability of Definability [PDF]
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011 AbstractFor a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ0, ϕ1, …, ϕn that define relations R0, R1, …, Rn over Γ. The question is whether the relation R0 is primitive positive definable from R1, …, Rn, i.e., definable by a first-order ...
Manuel Bodirsky +2 more
openaire +4 more sources
Resynchronized Uniformization and Definability Problems for Rational Relations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations.
Christof Löding, Sarah Winter
doaj +1 more source
Kähler moduli stabilization and the propagation of decidability [PDF]
Physical Review D, 2019 Diophantine equations are in general undecidable, yet appear readily in string theory. We demonstrate that numerous classes of Diophantine equations arising in string theory are decidable and propose that decidability may propagate through networks of ...
James Halverson +3 more
semanticscholar +1 more source
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing, 2011 Wil M.P. van der Aalst +6 more
exaly +2 more sources
On the decidability of reachability in linear time-invariant systems [PDF]
International Conference on Hybrid Systems: Computation and Control, 2018 We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean ...
Nathanaël Fijalkow +4 more
semanticscholar +1 more source
DECIDING ON WHAT TO DECIDE [PDF]
International Economic Review, 2017 AbstractWe study two‐stage collective decision‐making procedures where in the first stage, part of the voters decide what issues will be put in the agenda and in the second stage, the whole set of voters decides on the positions to be adopted regarding the issues that are in the agenda.
Barberà, Salvador, Gerber, Anke
openaire +6 more sources
Decidability, complexity, and expressiveness of first-order logic over the subword ordering [PDF]
Logic in Computer Science, 2017 We consider first-order logic over the subword ordering on finite words where each word is available as a constant. Our first result is that the Σ1 theory is undecidable (already over two letters).
Simon Halfon +2 more
semanticscholar +1 more source
E-unification by means of tree tuple synchronized grammars [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four ...
Sébastien Limet, Pierre Réty
doaj +1 more source
Decision Problems for Deterministic Pushdown Automata on Infinite Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The article surveys some decidability results for DPDAs on infinite words (omega-DPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak omega-DPDAs.
Christof Löding
doaj +1 more source