Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Sukhamay Kundu"'
Autor:
Sukhamay Kundu, Amit A. Nanavati
Publikováno v:
Complex Networks and Their Applications XI ISBN: 9783031211300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf72c43b3c8c5ef3b8d9d84aa7377374
https://doi.org/10.1007/978-3-031-21131-7_3
https://doi.org/10.1007/978-3-031-21131-7_3
Autor:
Sukhamay Kundu
Publikováno v:
Data Mining and Big Data ISBN: 9789811989902
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c8a0f1d62333307048feba6e047815c
https://doi.org/10.1007/978-981-19-8991-9_6
https://doi.org/10.1007/978-981-19-8991-9_6
Autor:
Sukhamay Kundu
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811540318
The current fuzzy methods for determining a group consensus ranking (GCR) or, equivalently, a linear order of items of a finite set S from a given set of weighted linear orders \(\mathcal {L}= \{L_1, L_2, \ldots , L_M\}\) on S are ad hoc in nature. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e10e3b1a7dc7901f9a92494585c4601
https://doi.org/10.1007/978-981-15-4032-5_48
https://doi.org/10.1007/978-981-15-4032-5_48
Autor:
Sukhamay Kundu
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811507502
We present a powerful generalization \(\lambda _d(A, B)\) of the min-transitive fuzzy left-relation \(\lambda (A, B)\) on finite intervals, where the parameter d is a weight-distribution function for the points of A and B. For many applications, \(\l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e34f53319bb1484fc9e7dc964794ab39
https://doi.org/10.1007/978-981-15-0751-9_8
https://doi.org/10.1007/978-981-15-0751-9_8
Autor:
Sukhamay Kundu
Publikováno v:
Information Processing Letters. 130:58-62
The new algorithm finds an optimal k-distance dominating set D in a weighted trees T = ( V , E ) with link-weights w ( x , y ) > 0 in time O ( | V | ) . It generalizes a previous linear time algorithm for an optimal k-hop dominating set for an unweig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed0e2e4a963f986a459f035586473df0
https://doi.org/10.1016/j.ipl.2017.10.009
https://doi.org/10.1016/j.ipl.2017.10.009
Autor:
Muhammad Alfian Amrizal, Sukhamay Kundu, Ryusuke Egawa, Jorge Fernández-Fabeiro, Hiroyuki Takizawa, David P. Bunde, Alina Lazar, Arturo Gonzalez-Escribano, Steven Bogaerts, Allen D. Malony, Mulya Agung, Daniel Ellsworth
Publikováno v:
EduHPC@SC
Peachy Parallel assignments are high-quality assign- ments for teaching parallel and distributed computing. They have been successfully used in class and are selected on the basis of their suitability for adoption and for being cool and inspirational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b7092707863eb0716b727e71afc9b6a
https://doi.org/10.1109/eduhpc49559.2019.00015
https://doi.org/10.1109/eduhpc49559.2019.00015
Autor:
Sukhamay Kundu, Subhashis Majumder
Publikováno v:
Information Processing Letters. 116:197-202
We give a linear time algorithm to compute an optimal (minimum) k-hop dominating set D of a tree T for k ? 1 . This extends the previous result for an optimal 1-dominating set for trees. We use a rooted form T ? of T, with an arbitrary node selected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48f8dc635b8a8b32f9726bb6643fedb7
https://doi.org/10.1016/j.ipl.2015.07.014
https://doi.org/10.1016/j.ipl.2015.07.014
Autor:
Sukhamay Kundu
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811305887
We first consider the “discrete” domain of non-empty finite subsets \(X = \{x_1, x_2, \ldots , x_m \}\) of \(\mathcal {R} = (-\infty , +\infty )\), where each \(x_i\) has a weight or probability \(P_X(x_i) > 0\). We define a min-transitive fuzzy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c9c9f94b7746066045f487b069bc24c
https://doi.org/10.1007/978-981-13-0589-4_38
https://doi.org/10.1007/978-981-13-0589-4_38
Autor:
Sukhamay Kundu
Publikováno v:
Pattern Recognition. 39:363-372
A basic technique in comparing and detecting changes in geographical spatial data from satellite images consists of identifying linear features or edges in the image and then matching those features. A chain of connected linear features which form a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df77882797274b8fea041a280fde2c35
https://doi.org/10.1016/j.patcog.2004.12.017
https://doi.org/10.1016/j.patcog.2004.12.017