Zobrazeno 1 - 10
of 195
pro vyhledávání: '"Boolean combination"'
Publikováno v:
Frontiers in Big Data, Vol 6 (2023)
Networks (or graphs) are used to model the dyadic relations between entities in complex systems. Analyzing the properties of the networks reveal important characteristics of the underlying system. However, in many disciplines, including social scienc
Externí odkaz:
https://doaj.org/article/97835fa7173d47ef9fb8f035753382d4
Publikováno v:
EURASIP Journal on Image and Video Processing, Vol 2018, Iss 1, Pp 1-22 (2018)
Abstract This paper considers a scenario when we have multiple pre-trained detectors for detecting an event and a small dataset for training a combined detection system. We build the combined detector as a Boolean function of thresholded detector sco
Externí odkaz:
https://doaj.org/article/f2343e2c2baf44f3a52926655b9bf7ac
Autor:
Anonymous
We have meticulously prepared this comprehensive replication package to facilitate further investigation and validation of our groundbreaking study on Just-In-Time Software Defects Prediction (JIT-SDP) models. It serves as a valuable resource, offeri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c096841df3f3d244f2662f8e1bc3913
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Roman Kossak, Wanda Siedlecka
Publikováno v:
Theoria. 87:959-970
Publikováno v:
LSFA
We investigate the distinguishability of sets of relational structures concerning a class of structures in the following sense: for a fixed class of structures, given two sets of structures in this class, find a first-order formula of minimal quantif
Autor:
Thomas Place, Marc Zeitoun
Publikováno v:
Journal of the ACM (JACM)
Journal of the ACM (JACM), Association for Computing Machinery, 2019, 66, pp.12:1--12:65. ⟨10.1145/3303991⟩
Journal of the ACM (JACM), Association for Computing Machinery, 2019, 66, pp.12:1--12:65. ⟨10.1145/3303991⟩
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular langua
Autor:
Joshua Gert
Publikováno v:
Philosophical Studies. 176:1409-1416
Jamie Dreier has argued that the supervenience of the moral on the non-moral requires explanation, and that attempts by the non-naturalist to provide it, or to sidestep the issue, have so far failed. These comments on Dreier first examine the notion
Autor:
N. S. Romanovskii
Publikováno v:
Algebra and Logic. 57:478-489
A group G is said to be rigid if it contains a normal series G = G1 > G2 > . . . > Gm > Gm+1 = 1, whose quotients Gi/Gi+1 are Abelian and, treated as right ℤ[G/Gi]-modules, are torsion-free. A rigid group G is divisible if elements of the quotient
Autor:
Alexei Myasnikov, Olga Kharlampovich
Publikováno v:
Groups and Model Theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57f24164b2fcc96bfe9a622edcdf0996
https://doi.org/10.1515/9783110719710-003
https://doi.org/10.1515/9783110719710-003