1 citations · 2 across the 10 of their papers we have counts for
10 papers
Cascading Gradient Inversion via LT-Code Inspired Peeling in Federated Learning
Saeed Shariati, Mohsen Alambardar Meybodi
Federated learning shares model updates rather than raw data, yet these updates can be inverted to reconstruct the clients' training data. Analytic reconstruction attacks, which in…
An AI-powered Public Health Automated Kiosk System for Personalized Care: An Experimental Pilot Study
Sonya Falahati, Morteza Alizadeh, Fatemeh Ghazipour +3
Background: The HERMES Kiosk (Healthcare Enhanced Recommendations through Artificial Intelligence & Expertise System) is designed to provide personalized Over-the-Counter (OTC) med…
AllMetrics: A Unified Python Library for Standardized Metric Evaluation and Robust Data Validation in Machine Learning
Morteza Alizadeh, Mehrdad Oveisi, Sonya Falahati +6
Machine learning (ML) models rely heavily on consistent and accurate performance metrics to evaluate and compare their effectiveness. However, existing libraries often suffer from…
On -Domination in Interval and Circle Graphs
Mohsen Alambardar Meybodi, Abolfazl Poureidi
A subset of vertices in a graph is a Dominating Set if each vertex in is adjacent to at least one vertex in . Chellali et al. in 2013, by restri…
W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs
Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba
A set of a graph is called an outer-connected dominating set of if every vertex not in is adjacent to at least one vertex in , and the in…
On Mixed Domination in Generalized Petersen Graphs
M. Rajaati, M. R. Hooshmandasl, M. Alambardar Meybodi +1
Given a graph , a set of vertices and edges is called a mixed dominating set if every vertex and edge that is not included in happens to be a…
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . Fomin et al.[9] gave an algorithm for…
A note on belief structures and S-approximation spaces
Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl +1
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempster's multivalued mappings and lower and upper probabi…
An Explicit Construction of Optimal Dominating Sets in Grid
P. Sharifani, M. R. Hooshmandasl, M. Alambardar Meybodi
A dominating set in a graph is a subset of vertices such that every vertex in is a neighbor of some vertex of . The domination number of is the minimu…
A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces
M. R. Hooshmandasl, M. Alambardar Meybodi, A. K. Goharshady +1
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spa…