Search results for "k-MST"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
123	Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar	Local MST computation with short advice.	SPAA	2007	DBLP DOI BibTeX RDF	distributed algorithm, minimum spanning tree, local computation
81	Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang	A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.	ISPAN	1999	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
69	Fabio Belloni, Andreas Richter, Visa Koivunen	DoA Estimation Via Manifold Separation for Arbitrary Array Structures.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
69	Seth Pettie	An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
69	Michael Elkin	A faster distributed protocol for constructing a minimum spanning tree.	SODA	2004	DBLP BibTeX RDF
65	Deyu Zhou, Yulan He 0001, Chee Keong Kwoh 0001, Hao Wang	Ant-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering.	PRIB	2007	DBLP DOI BibTeX RDF	ant-based clustering, clustering, minimum spanning tree, gene expression data
58	Hongju Cheng, Qin Liu 0003, Xiaohua Jia	Heuristic algorithms for real-time data aggregation in wireless sensor networks.	IWCMC	2006	DBLP DOI BibTeX RDF	degree and hop constrained MST, sensor networks, real-time, data aggregation
58	Hongxu Cai, Yingchao Zhao 0001	On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	broadcasting, ad hoc wireless networks, MST
58	Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar 0001	Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
58	Maleq Khan, Gopal Pandurangan	A fast distributed approximation algorithm for minimum spanning trees.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm
58	Yongwook Choi, Maleq Khan, V. S. Anil Kumar 0001, Gopal Pandurangan	Energy-optimal distributed algorithms for minimum spanning trees.	SPAA	2008	DBLP DOI BibTeX RDF	distributed algorithm, energy-efficient, minimum spanning tree, distributed approximation algorithm
58	Maleq Khan, Gopal Pandurangan	A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.	DISC	2006	DBLP DOI BibTeX RDF	Minimum Spanning Tree, Distributed Approximation Algorithm
58	Qing Dai, Jie Wu 0001	Computation of Minimal Uniform Transmission Range in Ad Hoc Wireless Networks.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power
58	Enrico Nardelli, Guido Proietti, Peter Widmayer	Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.	Algorithmica	2004	DBLP DOI BibTeX RDF	Transient node failures, Fault tolerance, Graph algorithms, Minimum spanning tree, Algorithmic mechanism design
58	Carsten Tzschoppe, Franz Rothlauf, Hans Josef Pesch	The Edge-Set Encoding Revisited: On the Bias of a Direct Representation for Trees.	GECCO (2)	2004	DBLP DOI BibTeX RDF
58	Aaron Archer, David P. Williamson	Faster approximation algorithms for the minimum latency problem.	SODA	2003	DBLP BibTeX RDF
58	Qing Dai, Jie Wu 0001	Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks.	ICDCS Workshops	2003	DBLP DOI BibTeX RDF	power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power
58	Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong	A New Approach to the Rectilinear Steiner Tree Problem.	DAC	1989	DBLP DOI BibTeX RDF
53	Zvi Lotker, Boaz Patt-Shamir, David Peleg	Distributed MST for constant diameter graphs.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Minimum-weight spanning tree, Distributed algorithm
53	Zvi Lotker, Boaz Patt-Shamir, David Peleg	Distributed MST for constant diameter graphs.	PODC	2001	DBLP DOI BibTeX RDF
53	Jungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura	Distributed Algorithms for Reconstructing MST after Topology Change.	WDAG	1990	DBLP DOI BibTeX RDF
53	Mst. Rubina Aktar, Md. Shamim Anower, Md. Zahurul Islam Sarkar, Abu Sadat Md. Sayem, Md. Rashedul Islam, Allama Iqbal Akash, Mst. Rumana Akter Rume, Gholamhosein Moloudian, Ali Lalbakhsh	Energy-Efficient Hybrid Powered Cloud Radio Access Network (C-RAN) for 5G.	IEEE Access	2023	DBLP DOI BibTeX RDF
53	Tahasin Ahmed Fahim, Mst Farzana Khatun, A. M. Mahfuz-Ur-Rahman, Md. Shamim Anower, Ajay Krishno Sarkar, Mahbubur Rahman, Mafin Muntasir Rahman, Fazlur Rashid, Mst Nahida Akter	An embedded system for observing the stages of lung cancer in non-invasive way.	GCCE	2017	DBLP DOI BibTeX RDF
47	Ying Li, Junjie Li, Huilong Duan, Xudong Lu	Structuralization of Digestive Endoscopic Report Based on NLP.	BMEI (1)	2008	DBLP DOI BibTeX RDF	NLP, Structuralization, MST
47	Jiaxiang Lin, Dongyi Ye, Chongcheng Chen, Miaoxian Gao	Minimum Spanning Tree Based Spatial Outlier Mining and Its Applications.	RSKT	2008	DBLP DOI BibTeX RDF	Spatial outliers, MST Clustering, D-TIN, Outlier mining
47	Hasan Arslan, Shantanu Dutt	An effective hop-based detailed router for FPGAs for optimizing track usage and circuit performance.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	bump and refit paradigm, bumping cost, hop-based routing, switchbox, FPGAs, detailed routing, MST
46	Qing Wang 0018, Huiyou Chang	Multitasking bar: prototype and evaluation of introducing the task concept into a browser.	CHI	2010	DBLP DOI BibTeX RDF	multiple sessions task, tasks, browser, multitasking, revisitation
46	Victor Olman, Fenglou Mao, Hongwei Wu, Ying Xu 0001	Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	genome application, Pattern recognition, parallel processing, clustering algorithm
46	Seth Pettie, Vijaya Ramachandran	Randomized minimum spanning tree algorithms using exponentially fewer random bits.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Graph algorithms, minimum spanning trees, random sampling
46	Amos Korman, Shay Kutten	Distributed verification of minimum spanning trees.	Distributed Comput.	2007	DBLP DOI BibTeX RDF	Graph property verification, Proof labeling schemes, Self stabilization, Minimum spanning tree, Labeling schemes, Network algorithms
46	Peilin Jiang, Hua Xiang 0003, Fuji Ren, Shingo Kuroiwa, Nanning Zheng 0001	The Framework of Mental State Transition Analysis.	MICAI	2007	DBLP DOI BibTeX RDF	Mental State Transition, Psychological Experiment, HCI, Virtual Character
46	Amos Korman, Shay Kutten	Distributed verification of minimum spanning trees.	PODC	2006	DBLP DOI BibTeX RDF	graph property verification, proof labeling, distributed algorithms, self stabilization, minimum spanning tree, labeling schemes, network algorithms
46	Kunihiko Fukushima, Kazuya Tohyama	Neural Network Model for Extracting Optic Flow.	ICANN (1)	2005	DBLP DOI BibTeX RDF
46	Ahmed A. Belal, Amr Elmasry	Finding maximum-cost minimum spanning trees.	AICCSA	2005	DBLP DOI BibTeX RDF
46	Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi	Minimum-power multicast routing in static ad hoc wireless networks.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	approximation algorithms, power control, multicast routing
46	Sang-Moon Soak, David Corne, Byung-Ha Ahn	A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems.	PPSN	2004	DBLP DOI BibTeX RDF
46	Paolo Penna, Carmine Ventre	Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.	PE-WASUN	2004	DBLP DOI BibTeX RDF	light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees
46	Andrew Beveridge, Alan M. Frieze, Colin McDiarmid	Random Minimum Length Spanning Trees in Regular Graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C80, 60C05
46	Gabriel Robins, Jeffrey S. Salowe	On the Maximum Degree of Minimum Spanning Trees.	SCG	1994	DBLP DOI BibTeX RDF
42	JianLiang Meng, WeiXiang Cheng	MST Clustering Algorithm Based on Optimized Grid.	IIH-MSP	2008	DBLP DOI BibTeX RDF	grid-based, center points, MST
37	Fadi Saar	Mst-based cluster analysis: A New algorithm for determining inconsistent edges (Mst tabanlı küme analizi: Tutarsız kenarları belirlemek için yeni bir algoritma)		2021	RDF
37	Rintu Panja, Sathish Vadhiyar	MND-MST: A Multi-Node Multi-Device Parallel Boruvka's MST Algorithm.	ICPP	2018	DBLP DOI BibTeX RDF
37	F. Javier Luque, Margarida Bachs, Modesto Orozco	An Optimized AM1/MST Method for the MST-SCRF Representation of Solvated Systems.	J. Comput. Chem.	1994	DBLP DOI BibTeX RDF
36	Baruch Awerbuch, Yossi Azar	Buy-at-Bulk Network Design.	FOCS	1997	DBLP DOI BibTeX RDF	buy-at-bulk network design, central network switch, multi-sink network design, selective network design, Generalized Steiner Connectivity, Prize-collecting salesman, K-MST, connectivity, network routing, network capacity
35	Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin	Average-Case Analyses of Vickrey Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
35	Xiang Fan, Shun-ren Xia	Feature Based Automatic Stitching of Microscopic Images.	ICIC (3)	2007	DBLP DOI BibTeX RDF	BBF, SIFT, Image Stitching, Microscopic Image, MST
35	Sanghyun Ahn, David Hung-Chang Du	A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications.	LCN	1996	DBLP DOI BibTeX RDF	multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic
35	Patricia C. Arocena, Ariel Fuxman, Renée J. Miller	Composing local-as-view mappings: closure and applications.	ICDT	2010	DBLP DOI BibTeX RDF
35	Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil	A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property.	DISC	2009	DBLP DOI BibTeX RDF
35	Hirotaka Susukida, Fei Ma, Mariusz Bajger	Automatic tuning of a graph-based image segmentation method for digital mammography applications.	ISBI	2008	DBLP DOI BibTeX RDF
35	MohammadAli Safari, Mohammad R. Salavatipour	A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
35	Carla Silva Rocha Aguiar, Sébastien Druon, André Crosnier	3D datasets segmentation based on local attribute variation.	IROS	2007	DBLP DOI BibTeX RDF
35	R. Ravi 0001, Mohit Singh	Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
35	Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju	Distributed Spanner Construction in Doubling Metric Spaces.	OPODIS	2006	DBLP DOI BibTeX RDF
35	Naveed Iqbal Rao, Huijun Di, Guangyou Xu	Refine Stereo Correspondence Using Bayesian Network and Dynamic Programming on a Color Based Minimal Span Tree.	ACIVS	2006	DBLP DOI BibTeX RDF
35	Timothy M. Chan	Finding the shortest bottleneck edge in a parametric minimum spanning tree.	SODA	2005	DBLP BibTeX RDF
35	María Isabel González Vasco, Consuelo Martínez, Rainer Steinwandt	Towards a Uniform Description of Several Group Based Cryptographic Primitives.	Des. Codes Cryptogr.	2004	DBLP DOI BibTeX RDF	group-based cryptography, finitely presented groups, public key cryptography
35	Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabián García Nocetti, Julio Solano-González	Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks.	WEA	2004	DBLP DOI BibTeX RDF
35	Xiuzhen Cheng 0001, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu	Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics.	IEEE Trans. Mob. Comput.	2003	DBLP DOI BibTeX RDF	Minimum energy topology, incremental power heuristic, wireless sensor networks, NP-Completeness, power control
35	Anil K. Jain 0001, Xiaowei Xu, Tin Kam Ho, Fan Xiao	Uniformity Testing Using Minimal Spanning Tree.	ICPR (4)	2002	DBLP DOI BibTeX RDF
35	Li-Jen Mao, Sheau-Dong Lang	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.	ICPP Workshops	2002	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
35	Narsingh Deo, Ayman M. Abdalla	Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.	CIAC	2000	DBLP DOI BibTeX RDF
35	Mikkel Thorup, David R. Karger	Dynamic Graph Algorithms with Applications.	SWAT	2000	DBLP DOI BibTeX RDF
35	Alan R. Dennis, Joseph S. Valacich, Cheri Speier, Michael G. Morris	Beyond Media Richness: An Empirical Test of Media Synchronicity Theory.	HICSS (1)	1998	DBLP DOI BibTeX RDF
35	Gheorghe Antonoiu, Pradip K. Srimani	Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction.	Euro-Par	1997	DBLP DOI BibTeX RDF
35	Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang	Closing the gap: near-optimal Steiner trees in polynomial time.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
35	Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares	New Sparseness Results on Graph Spanners.	SCG	1992	DBLP DOI BibTeX RDF
35	Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong	New algorithms for the rectilinear Steiner tree problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
30	Ioannis Caragiannis, Michele Flammini, Luca Moscardelli	An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks.	ICALP	2007	DBLP DOI BibTeX RDF
30	Sanjeev Arora, George Karakostas	A 2 + epsilon approximation algorithm for the k-MST problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	k-Minimum Spanning Tree, Primal-Dual schema, Approximation algorithm
30	Toshihiro Fujito	How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.	ICALP (1)	2006	DBLP DOI BibTeX RDF
30	Clinton Nielsen, Xiaobo Li 0001	MST for Lossy Compression of Image Sets.	DCC	2006	DBLP DOI BibTeX RDF
30	Ning Li 0014, Jennifer C. Hou, Lui Sha	Design and analysis of an MST-based topology control algorithm.	IEEE Trans. Wirel. Commun.	2005	DBLP DOI BibTeX RDF
30	W. Jongkind	The Dutch MST Program MicroNed and its Cluster MISAT.	ICMENS	2005	DBLP DOI BibTeX RDF
30	Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri	Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.	SIROCCO	2005	DBLP DOI BibTeX RDF
30	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm
30	Xiang-Yang Li 0001, Yu Wang 0003, Wen-Zhan Song 0001	Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF	broadcasting, wireless ad hoc networks, topology control, minimum spanning tree, Localized algorithms
30	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.	ICALP	2003	DBLP DOI BibTeX RDF
30	Jochen Könemann, R. Ravi 0001	Primal-dual meets local search: approximating MST's with nonuniform degree bounds.	STOC	2003	DBLP DOI BibTeX RDF	degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
30	Jeonghun Cho, Yunheung Paek, David B. Whalley	Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms.	LCTES-SCOPES	2002	DBLP DOI BibTeX RDF	dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree
30	David Peleg, Vitaly Rubinovich	A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction.	FOCS	1999	DBLP DOI BibTeX RDF
30	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
26	Md. Abdur Rahman, Aminul Huq, Salma Sultana Tunny, Maruf Hossain Anik, Mst. Tasnim Pervin, Md. Rashidul Islam	A feasibility analysis of image approximation with image quality assessments.	IET Image Process.	2024	DBLP DOI BibTeX RDF
26	Md Hadisur Rahman, Md. Rabiul Hasan, Nahian Ismail Chowdhury, Md Asif Bin Syed, Mst Ummul Farah	Predictive Health Analysis in Industry 5.0: A Scientometric and Systematic Review of Motion Capture in Construction.	CoRR	2024	DBLP DOI BibTeX RDF
26	Utsha Roy, Mst. Sazia Tahosin, Md. Mahedi Hassan, Taminul Islam, Fahim Imtiaz, Md Rezwane Sadik, Yassine Maleh, Rejwan Bin Sulaiman, Md. Simul Hasan Talukder	Enhancing Bangla Fake News Detection Using Bidirectional Gated Recurrent Units and Deep Learning Techniques.	CoRR	2024	DBLP DOI BibTeX RDF
26	Azmine Toushik Wasi, Raima Islam, Mst Rafia Islam	Ink and Individuality: Crafting a Personalised Narrative in the Age of LLMs.	CoRR	2024	DBLP DOI BibTeX RDF
26	Azmine Toushik Wasi, Mst Rafia Islam, Raima Islam	LLMs as Writing Assistants: Exploring Perspectives on Sense of Ownership and Reasoning.	CoRR	2024	DBLP DOI BibTeX RDF
26	Mst Shamim Ara Shawkat, Md Musabbir Adnan, Rocco D. Febbo, John J. Murray, Garrett S. Rose	A Single Chip SPAD Based Vision Sensing System With Integrated Memristive Spiking Neuromorphic Processing.	IEEE Access	2023	DBLP DOI BibTeX RDF
26	Amena Begum Farha, Md. Azizul Hakim, Mst. Eshita Khatun	Local Rose Breeds Detection System Using Transfer Learning Techniques.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Sheikh Iqbal Ahamed, Kishor Datta Gupta, Muhammad Asadur Rahman, Atef Mohamed, Mohammad Rahman, Akond Rahman, Fan Wu 0013	Case Study-Based Approach of Quantum Machine Learning in Cybersecurity: Quantum Support Vector Machine for Malware Classification and Protection.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Juanjose Rodriguez-Cardenas, Hossain Shahriar, Akond Rahman, Fan Wu 0013	Teaching DevOps Security Education with Hands-on Labware: Automated Detection of Security Weakness in Python.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea	Autism Disease Detection Using Transfer Learning Techniques: Performance Comparison Between Central Processing Unit vs Graphics Processing Unit Functions for Neural Networks.	CoRR	2023	DBLP DOI BibTeX RDF
26	Aakash Ahmad, Muhammad Waseem, Peng Liang 0001, Mahdi Fahmideh, Mst Shamima Aktar, Tommi Mikkonen	Towards Human-Bot Collaborative Software Architecting with ChatGPT.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea, Nova Ahmed, Carson K. Leung	Handwritten Word Recognition using Deep Learning Approach: A Novel Way of Generating Handwritten Words.	CoRR	2023	DBLP DOI BibTeX RDF
26	Md. Simul Hasan Talukder, Mohammad Raziuddin Chowdhury, Md Sakib Ullah Sourav, Abdullah Al Rakin, Shabbir Ahmed Shuvo, Rejwan Bin Sulaiman, Musarrat Saberin Nipun, Muntarin Islam, Mst Rumpa Islam, Md Aminul Islam, Zubaer Haque	JutePestDetect: An Intelligent Approach for Jute Pest Identification Using Fine-Tuned Transfer Learning.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea	A Trustable LSTM-Autoencoder Network for Cyberbullying Detection on Social Media Using Synthetic Data.	CoRR	2023	DBLP DOI BibTeX RDF
26	Md. Hamjajul Ashmafee, Tasnim Ahmed, Sabbir Ahmed, Md. Bakhtiar Hasan, Mst Nura Jahan, A. B. M. Ashikur Rahman	An Efficient Transfer Learning-based Approach for Apple Leaf Disease Classification.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Md. Jobair Hossain Faruk, Nafisa Anjum, Mohammad Masum, Hossain Shahriar, Akond Rahman, Fan Wu 0013, Alfredo Cuzzocrea	Software Supply Chain Vulnerabilities Detection in Source Code: Performance Comparison between Traditional and Quantum Machine Learning Algorithms.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Iysa Iqbal, Md Faruque Hossain, M. A. Karim, Victor Clincy, Razvan Voicu	Exploring the Vulnerabilities of Machine Learning and Quantum Machine Learning to Adversarial Attacks using a Malware Dataset: A Comparative Analysis.	CoRR	2023	DBLP DOI BibTeX RDF
26	Mst. Shapna Akter, Hossain Shahriar, Zakirul Alam Bhuiya	Automated Vulnerability Detection in Source Code Using Quantum Natural Language Processing.	CoRR	2023	DBLP DOI BibTeX RDF