Zobrazeno 1 - 10
of 13
pro vyhledávání: '"P. B., Ramkumar"'
Autor:
P. M., Dhanya1 dhanya_pm@rajagiritech.edu.in, P. B., Ramkumar2 ramkumar_pb@rajagiritech.edu.in
Publikováno v:
Neutrosophic Sets & Systems. 2023, Vol. 61, p337-364. 28p.
The recently proposed open-source KAZE image feature detection and description algorithm offers unprecedented performance in comparison to conventional ones like SIFT and SURF as it relies on nonlinear scale spaces instead of Gaussian linear scale sp
Externí odkaz:
http://arxiv.org/abs/1706.06750
Autor:
B., Ramkumar, Kittur, Harish M.
Based on the ASIC layout level simulation of 7 types of adder structures each of four different sizes, i.e. a total of 28 adders, we propose expressions for the width of each of the three regions of the final Carry Propagate Adder (CPA) to be used in
Externí odkaz:
http://arxiv.org/abs/1110.3584
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2018 (2018)
A hypergraph consisting of hyperedges and nodes can be made intuitionistic fuzzy hypergraph (IFHG) by assigning membership and nonmembership degrees for both nodes and edges. Just as a hypergraph, an IFHG is also having hyperedges consisting of many
Externí odkaz:
https://doaj.org/article/21a77a07dce5462a82c275d11efa6d9e
Publikováno v:
Materials Today: Proceedings. 11:912-919
Thermal barrier coatings (TBC) are highly advanced materials applied to metallic surfaces, such as on gas turbine operating at elevated temperatures. These coatings can allow higher operating temperatures and limits the thermal exposure of structural
Autor:
Abraham Jacob, P. B. Ramkumar
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9789811601736
In this paper, we define morphological topology (\(\mathcal {M}\)-topology) on intuitionistic fuzzy graph (IFG). We also define neighbourhood graph, continuity and isomorphism between \(\mathcal {M}\)-topologies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5d06f6280e4f143b4a84ca643a2f975
https://doi.org/10.1007/978-981-16-0174-3_21
https://doi.org/10.1007/978-981-16-0174-3_21
Autor:
Chandran R. Deepthi, P. B. Ramkumar
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9789811601736
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acab425c3eceb710e6b922330a149e44
https://doi.org/10.1007/978-981-16-0174-3_23
https://doi.org/10.1007/978-981-16-0174-3_23
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9789811601736
Graph polynomial is a graph invariant whose values are polynomials and found many applications in different fields of science. The goal of this paper is to connect the theory of fractal geometry to the theory of the much broader class graph theory us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b18a3ef0acf16883edd8a7dc79bda335
https://doi.org/10.1007/978-981-16-0174-3_16
https://doi.org/10.1007/978-981-16-0174-3_16
Publikováno v:
Communication and Intelligent Systems ISBN: 9789811533242
Cities are evolving into smart cities, and most of its day-to-day activities are automated. One such important activity is the city vehicle parking mechanism. We propose a smart parking system which helps drivers to choose a parking slot based on his
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7879d70706b9eed96040b73cab37df33
https://doi.org/10.1007/978-981-15-3325-9_3
https://doi.org/10.1007/978-981-15-3325-9_3
Publikováno v:
ISRN Discrete Mathematics. 2014:1-6
The focus of this paper is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctio