Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Exponential complexity"'
Publikováno v:
Matematika i Matematičeskoe Modelirovanie, Vol 0, Iss 3, Pp 29-45 (2021)
The paper studies problems of reduction (decomposition) of OLAP-hypercube multidimensional data models. When decomposing large hyper-cubes of multidimensional data into sub-cube components the goal is to increase the computational performance of anal
Externí odkaz:
https://doaj.org/article/3a6c6e9c43764c668cc835843e3172e7
Autor:
Dmitriy Divakov, Gleb Beliakov
Publikováno v:
Fuzzy Sets and Systems. 446:222-232
We outline recent trends in capacity-based aggregation in large universes. Capacities (fuzzy measures) model dependencies among the inputs, and aggregation by the discrete Choquet, Sugeno and other fuzzy integrals accounts for synergies and redundanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87bed85712220a3fcd6ba5d805129120
https://doi.org/10.1016/j.fss.2021.03.009
https://doi.org/10.1016/j.fss.2021.03.009
Autor:
Ю. И. Кобылина
Publikováno v:
Фінансово-кредитна діяльність: проблеми теорії та практики, Vol 1, Iss 14, Pp 140-144 (2014)
В статье приводиться краткий анализ квантовых сетей, а также сравнительные данные по определению сложности взлома алгоритмов на класси
Externí odkaz:
https://doaj.org/article/26979a2049ad4ad9939f9df90a2eb37c
Publikováno v:
The Electronic Journal of Combinatorics. 28
By the Pieri rule, the tensor product of an exterior power and a finite-dimensional irreducible representation of a general linear group has a multiplicity-free decomposition. The embeddings of the constituents are called Pieri inclusions and were fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcc44b16ff72cd76338267af9bd22880
https://doi.org/10.37236/9216
https://doi.org/10.37236/9216
Autor:
Yirui Liu, John MacLaren Walsh
Publikováno v:
ISIT
A great many problems in network information theory, both fundamental and applied, involve determining a minimal set of inequalities linking the Shannon entropies of a certain collection of subsets of random variables. In principle this minimal set o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2850935e3694c01db01078eb51b29923
https://doi.org/10.1109/isit45174.2021.9518030
https://doi.org/10.1109/isit45174.2021.9518030
Autor:
Brian F. Redmond
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 298:75-80
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e31e837271a7517263b36ba8d4296405
https://doi.org/10.4204/eptcs.298.6
https://doi.org/10.4204/eptcs.298.6
Publikováno v:
Control Theory and Technology. 17:265-275
The diagnosability of discrete event systems has been a topic of interest to many researchers. The diagnosability conditions for various systems have evolved based on a regularity condition that is imposed on faulty traces with respect to their obser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d9e16d9ba8d28411aa664f8d119b6e4
https://doi.org/10.1007/s11768-019-7298-3
https://doi.org/10.1007/s11768-019-7298-3
Autor:
Kala Rahul
Publikováno v:
Robotica. 38:512-530
SummaryMission planning is a complex motion planning problem specified by using Temporal Logic constituting of Boolean and temporal operators, typically solved by model verification algorithms with an exponential complexity. The paper proposes co-evo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97d61026be1b67b5f305467349be1b89
https://doi.org/10.1017/s026357471900081x
https://doi.org/10.1017/s026357471900081x
Publikováno v:
Bioinformation
Latest studies have shown that Long Noncoding RNAs corresponds to a crucial factor in neurodegenerative diseases and next-generation therapeutic targets. A wide range of advanced computational methods for the analysis of Noncoding RNAs mainly include
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f712cd45b4ed12c29e1b774c6b84ed45
http://europepmc.org/articles/PMC6589468
http://europepmc.org/articles/PMC6589468
Publikováno v:
Discrete Applied Mathematics. 253:61-72
The units forms are algebraic expressions that have important role in representation theory of algebras. We identified that existing algorithms have exponential time complexity for weakly nonnegative and weakly positive types. In this paper we introd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::648db9e0273a294589a400afa387f3f8
https://doi.org/10.1016/j.dam.2018.06.018
https://doi.org/10.1016/j.dam.2018.06.018