Zobrazeno 1 - 10
of 56
pro vyhledávání: '"P. Kanagasabapathi"'
Publikováno v:
Tekstilec, Vol 63, Iss 1, Pp 14-26 (2020)
This work deals with the study of the oil sorption behaviour of needlepunched nonwoven fabrics produced from natural fibres such as cotton, cotton fl at waste, cotton/kapok blend, and nettle fibres. Polypropylene nonwoven fabric, which is used as a c
Externí odkaz:
https://doaj.org/article/b9cae500d67847b7809f30c04f8eb46d
Autor:
Cadar, Felipe, Melo, Welerson, Kanagasabapathi, Vaishnavi, Potje, Guilherme, Martins, Renato, Nascimento, Erickson R.
Publikováno v:
Pattern Recognition Letters 2023
We propose a novel learned keypoint detection method to increase the number of correct matches for the task of non-rigid image correspondence. By leveraging true correspondences acquired by matching annotated image pairs with a specified descriptor e
Externí odkaz:
http://arxiv.org/abs/2309.00434
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 741-746 (2024)
Let Ωn{\Omega }_{n} denote the set of all doubly stochastic matrices of order nn. Lih and Wang conjectured that for n≥3n\ge 3, per(tJn+(1−t)A)≤t\left(t{J}_{n}+\left(1-t)A)\le tperJn+(1−t){J}_{n}+\left(1-t)perAA, for all A∈ΩnA\in {\Omega }
Externí odkaz:
https://doaj.org/article/e552bf781cbd4c9385e4a78e0ea06295
Publikováno v:
Mathematics, Vol 12, Iss 19, p 3077 (2024)
This study proposes a general approach to protect graphs using co-secure domination within jump graphs. In the context of graphs, a dominating set is a group of vertices that are either directly linked or connected to all other vertices within the gr
Externí odkaz:
https://doaj.org/article/640ab6afa30b42b4a323e9600d889f06
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 339-351 (2023)
AbstractThe smallest integer k needed for the assignment of k colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing [126] and Behzad [6, 7] conjectured that the total colori
Externí odkaz:
https://doaj.org/article/caefb227191f48168e7bce4a81b67603
Publikováno v:
Symmetry, Vol 16, Iss 7, p 781 (2024)
A set S⊆V is referred to as a k-fault-tolerant power-dominating set of a given graph G=(V,E) if the difference S∖F remains a power-dominating set of G for any F⊆S with |F|≤k, where k is an integer with 0≤k<|V|. The lowest cardinality of a k
Externí odkaz:
https://doaj.org/article/57f90fc9aaa24208873e71f3378b2fde
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.
Publikováno v:
Discrete Mathematics Letters, Vol 9, Pp 92-99 (2022)
Externí odkaz:
https://doaj.org/article/a62f13f1d2314fa1a7c9515ebfc29a58
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.
Publikováno v:
Journal of Extension Education, Vol 32, Iss 3 (2021)
In Kerala state of India, ‘Kudumbashree’ programme was introduced with the intention of uplifting and empowering women engaged in agriculture and allied activities. A study was conducted to analyse the constraints experienced by women in ‘kudum
Externí odkaz:
https://doaj.org/article/a4c261864605499a96e840be51d5bab2