|
|
|
|
|
Mohammad H. Nadimi-Shahraki, Mahdis Banaie-Dezfouli, Hoda Zamani, Shokooh Taghian and Seyedali Mirjalili
Advancements in medical technology have created numerous large datasets including many features. Usually, all captured features are not necessary, and there are redundant and irrelevant features, which reduce the performance of algorithms. To tackle this...
ver más
|
|
|
|
|
|
|
|
|
Zhongming Teng and Xiaowei Zhang
In the large scale canonical correlation analysis arising from multi-view learning applications, one needs to compute canonical weight vectors corresponding to a few of largest canonical correlations. For such a task, we propose a Jacobi?Davidson type al...
ver más
|
|
|
|
|
|
|
|
|
I.A.K. Kamil,M.B. Abrosimov,A.A. Lobov
Pág. 54 - 58
In 1976 John Hayes proposed a graph-based model to investigate node fault tolerance of discrete systems. A graph G* is vertex k-extension of a graph G if after removing any k vertices from G* result graph contains G. A vertex k-extension of the graph G i...
ver más
|
|
|
|
|
|
|
|
|
Mikhail Abramyan,Boris Melnikov
Pág. 1 - 7
We consider the problem of state minimization of nondeterministic finite automata. One of the ways to solve it is to analyze a subset of the set of states of two canonical automa-ta constructed on the basis of the initial nondeterministic finite automato...
ver más
|
|
|
|
|
|
|
|
|
A. S. Belozerov,B. F. Melnikov,N. P. Churikova
Pág. 23 - 30
The unsolved problem of isomorphism of graphs is directly related to one of seven so-called millenium problems: with the problem of equality of classes P and NP from the theory of algorithms. The reason of this is a lack of a sertificate algorithm for te...
ver más
|
|
|
|