default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHana Khamfroush
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Nathaniel Hudson
, Hana Khamfroush, Matt Baughman, Daniel E. Lucani, Kyle Chard, Ian T. Foster:
QoS-aware edge AI placement and scheduling with multiple implementations in FaaS-based edge computing. Future Gener. Comput. Syst. 157: 250-263 (2024)- [j17]Pratham Oza, Nathaniel Hudson, Thidapat Chantem, Hana Khamfroush:
Deadline-Aware Task Offloading for Vehicular Edge Computing Networks Using Traffic Light Data. ACM Trans. Embed. Comput. Syst. 23(1): 8:1-8:25 (2024) - [c30]Hana Khamfroush:
Resource-aware Federated Data Analytics in Edge-Enabled IoT Systems. AAAI Spring Symposia 2024: 305 - [c29]Afsaneh Mahanipour, Hana Khamfroush:
Enhancing IoT Security: A Novel Feature Engineering Approach for ML-Based Intrusion Detection Systems. DCOSS-IoT 2024: 548-555 - [c28]Afsaneh Mahanipour, Hana Khamfroush:
FMLFS: A Federated Multi-Label Feature Selection Based on Information Theory in IoT Environment. SMARTCOMP 2024: 166-173 - [i9]Afsaneh Mahanipour, Hana Khamfroush:
Enhancing IoT Security: A Novel Feature Engineering Approach for ML-Based Intrusion Detection Systems. CoRR abs/2404.19114 (2024) - [i8]Afsaneh Mahanipour, Hana Khamfroush:
FMLFS: A federated multi-label feature selection based on information theory in IoT environment. CoRR abs/2405.00524 (2024) - 2023
- [j16]Sadoon Azizi, Majeed Othman, Hana Khamfroush:
DECO: A Deadline-Aware and Energy-Efficient Algorithm for Task Offloading in Mobile Edge Computing. IEEE Syst. J. 17(1): 952-963 (2023) - [j15]Mohammad Moed Ebrahimi, Keyhan Khamforoosh, Mohammad Reza Amini, Amir Sheikhahmadi, Hana Khamfroush:
Adaptive-Persistent Nonorthogonal Random Access Scheme for URLL Massive IoT Networks. IEEE Syst. J. 17(1): 1660-1671 (2023) - [c27]Afsaneh Mahanipour, Hana Khamfroush:
Multimodal Multiple Federated Feature Construction Method for IoT Environments. GLOBECOM 2023: 1890-1895 - [c26]Afsaneh Mahanipour, Hana Khamfroush:
Wrapper-Based Federated Feature Selection for IoT Environments. ICNC 2023: 214-219 - [i7]Afsaneh Mahanipour, Hana Khamfroush:
Multimodal Multiple Federated Feature Construction Method for IoT Environments. CoRR abs/2308.07131 (2023) - 2022
- [j14]Farough Ashkouti, Keyhan Khamforoosh, Amir Sheikhahmadi, Hana Khamfroush:
DHkmeans-ℓdiversity: distributed hierarchical K-means for satisfaction of the ℓ-diversity privacy model using Apache Spark. J. Supercomput. 78(2): 2616-2650 (2022) - [c25]Minoo Hosseinzadeh, Nathaniel Hudson, Sam Heshmati, Hana Khamfroush:
Communication-Loss Trade-Off in Federated Learning: A Distributed Client Selection Algorithm. CCNC 2022: 1-6 - [c24]Minoo Hosseinzadeh, Andrew Wachal, Hana Khamfroush, Daniel E. Lucani:
QoS-Aware Priority-Based Task Offloading for Deep Learning Services at the Edge. CCNC 2022: 319-325 - [c23]Nathaniel Hudson, Pratham Oza, Hana Khamfroush, Thidapat Chantem:
Smart Edge-Enabled Traffic Light Control: Improving Reward-Communication Trade-offs with Federated Reinforcement Learning. SMARTCOMP 2022: 40-47 - 2021
- [j13]Noor Felemban, Fidan Mehmeti, Hana Khamfroush, Zongqing Lu, Swati Rallapalli, Kevin S. Chan, Thomas La Porta:
PicSys: Energy-Efficient Fast Image Search on Distributed Mobile Networks. IEEE Trans. Mob. Comput. 20(4): 1574-1589 (2021) - [j12]Nathaniel Hudson, Hana Khamfroush:
Behavioral Information Diffusion for Opinion Maximization in Online Social Networks. IEEE Trans. Netw. Sci. Eng. 8(2): 1259-1268 (2021) - [j11]Vajiheh Farhadi, Fidan Mehmeti, Ting He, Thomas F. La Porta, Hana Khamfroush, Shiqiang Wang, Kevin S. Chan, Konstantinos Poularakis:
Service Placement and Request Scheduling for Data-Intensive Applications in Edge Clouds. IEEE/ACM Trans. Netw. 29(2): 779-792 (2021) - [c22]Minoo Hosseinzadeh, Nathaniel Hudson, Xiaobo Zhao, Hana Khamfroush, Daniel E. Lucani:
Joint Compression and Offloading Decisions for Deep Learning Services in 3-Tier Edge Systems. DySPAN 2021: 254-261 - [c21]Minoo Hosseinzadeh, Andrew Wachal, Hana Khamfroush, Daniel E. Lucani:
Optimal Accuracy-Time Trade-off for Deep Learning Services in Edge Computing Systems. ICC 2021: 1-6 - [c20]Nathaniel Hudson, Md. Jakir Hossain, Minoo Hosseinzadeh, Hana Khamfroush, Mahshid Rahnamay-Naeini, Nasir Ghani:
A Framework for Edge Intelligent Smart Distribution Grids via Federated Learning. ICCCN 2021: 1-9 - [c19]Nathaniel Hudson, Hana Khamfroush, Daniel E. Lucani:
QoS-Aware Placement of Deep Learning Services on the Edge with Multiple Service Implementations. ICCCN 2021: 1-8 - [i6]Nathaniel Hudson, Hana Khamfroush, Daniel E. Lucani:
QoS-Aware Placement of Deep Learning Services on the Edge with Multiple Service Implementations. CoRR abs/2104.15094 (2021) - 2020
- [j10]Upama Nakarmi, Mahshid Rahnamay-Naeini, Hana Khamfroush:
Critical Component Analysis in Cascading Failures for Power Grids Using Community Structures in Interaction Graphs. IEEE Trans. Netw. Sci. Eng. 7(3): 1079-1093 (2020) - [j9]Novella Bartolini, Ting He, Viviana Arrigoni, Annalisa Massini, Federico Trombetti, Hana Khamfroush:
On Fundamental Bounds on Failure Identifiability by Boolean Network Tomography. IEEE/ACM Trans. Netw. 28(2): 588-601 (2020) - [c18]Xiaobo Zhao, Minoo Hosseinzadeh, Nathaniel Hudson, Hana Khamfroush, Daniel E. Lucani:
Improving the Accuracy-Latency Trade-off of Edge-Cloud Computation Offloading for Deep Learning Services. GLOBECOM (Workshops) 2020: 1-6 - [c17]Matthew Turner, Hana Khamfroush:
Meeting Users' QoS in a Edge-to-Cloud Platform via Optimally Placing Services and Scheduling Tasks. ICNC 2020: 368-372 - [c16]Emory Hufbauer, Nathaniel Hudson, Hana Khamfroush:
A Proximity-Based Generative Model for Online Social Network Topologies. ICNC 2020: 648-653 - [c15]Nathaniel Hudson, Hana Khamfroush, Brent Harrison, Adam Craig:
Smart Advertisement for Maximal Clicks in Online Social Networks Without User Data. SMARTCOMP 2020: 172-179 - [c14]Adetola Adeniran, Md. Abul Hasnat, Minoo Hosseinzadeh, Hana Khamfroush, Mahshid Rahnamay-Naeini:
Edge Layer Design and Optimization for Smart Grids. SmartGridComm 2020: 1-6 - [i5]Emory Hufbauer, Hana Khamfroush:
Automatic Query Optimization for Retrieving Traffic Tweets. CoRR abs/2006.11887 (2020) - [i4]Minoo Hosseinzadeh, Andrew Wachal, Hana Khamfroush, Daniel E. Lucani:
Optimal Accuracy-Time Trade-off for Deep Learning Services in Edge Computing Systems. CoRR abs/2011.08381 (2020)
2010 – 2019
- 2019
- [j8]Hana Khamfroush, Nathaniel Hudson, Samuel Lofumbwa Iloo, Mahshid Rahnamay-Naeini:
Influence spread in two-layer interdependent networks: designed single-layer or random two-layer initial spreaders? Appl. Netw. Sci. 4(1): 40:1-40:21 (2019) - [j7]Diman Zad Tootaghaj, Novella Bartolini, Hana Khamfroush, Ting He, Nilanjan Ray Chaudhuri, Thomas La Porta:
Mitigation and Recovery From Cascading Failures in Interdependent Networks Under Uncertainty. IEEE Trans. Control. Netw. Syst. 6(2): 501-514 (2019) - [j6]Diman Zad Tootaghaj, Novella Bartolini, Hana Khamfroush, Thomas La Porta:
On Progressive Network Recovery From Massive Failures Under Uncertainty. IEEE Trans. Netw. Serv. Manag. 16(1): 113-126 (2019) - [c13]Md. Abul Hasnat, Md. Jakir Hossain, Adetola Adeniran, Mahshid Rahnamay-Naeini, Hana Khamfroush:
Situational Awareness Using Edge-Computing Enabled Internet of Things for Smart Grids. GLOBECOM Workshops 2019: 1-6 - [c12]Nathaniel Hudson, Matthew Turner, Asare Nkansah, Hana Khamfroush:
On the Effectiveness of Standard Centrality Metrics for Interdependent Networks. ICNC 2019: 842-846 - [c11]Vajiheh Farhadi, Fidan Mehmeti, Ting He, Tom La Porta, Hana Khamfroush, Shiqiang Wang, Kevin S. Chan:
Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. INFOCOM 2019: 1279-1287 - [i3]Novella Bartolini, Ting He, Viviana Arrigoni, Annalisa Massini, Hana Khamfroush:
On Fundamental Bounds of Failure Identifiability by Boolean Network Tomography. CoRR abs/1903.10636 (2019) - [i2]Matthew Turner, Hana Khamfroush:
Meeting QoS of Users in a Edge to Cloud Platform via Optimally Placing Services and Scheduling Tasks. CoRR abs/1908.04824 (2019) - [i1]Nathaniel Hudson, Hana Khamfroush, Brent Harrison, Adam Craig:
Click Maximization in Online Social Networks Using Optimal Choice of Targeted Interests. CoRR abs/1911.02061 (2019) - 2018
- [j5]Hana Khamfroush, Samuel Lofumbwa Iloo, Mahshid Rahnamay-Naeini:
Vulnerability of Interdependent Infrastructures Under Random Attacks. SIGMETRICS Perform. Evaluation Rev. 46(2): 67-71 (2018) - [c10]Ting He, Hana Khamfroush, Shiqiang Wang, Tom La Porta, Sebastian Stein:
It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-Sharable Resources. ICDCS 2018: 365-375 - 2017
- [c9]Novella Bartolini, Ting He, Hana Khamfroush:
Fundamental limits of failure identifiability by boolean network tomography. INFOCOM 2017: 1-9 - [c8]Stefano Ciavarella, Novella Bartolini, Hana Khamfroush, Thomas La Porta:
Progressive damage assessment and network recovery after massive failures. INFOCOM 2017: 1-9 - [c7]Diman Zad Tootaghaj, Hana Khamfroush, Novella Bartolini, Stefano Ciavarella, Seamus Hayes, Thomas La Porta:
Network recovery from massive failures under uncertain knowledge of damages. Networking 2017: 1-9 - [c6]Diman Zad Tootaghaj, Novella Bartolini, Hana Khamfroush, Thomas La Porta:
Controlling Cascading Failures in Interdependent Networks under Incomplete Knowledge. SRDS 2017: 54-63 - 2016
- [j4]Peyman Pahlevani, Hana Khamfroush, Daniel E. Lucani, Morten Videbæk Pedersen, Frank H. P. Fitzek:
Network coding for hop-by-hop communication enhancement in multi-hop networks. Comput. Networks 105: 138-149 (2016) - [j3]Hana Khamfroush, Novella Bartolini, Thomas F. La Porta, Ananthram Swami, Justin Dillman:
On Propagation of Phenomena in Interdependent Networks. IEEE Trans. Netw. Sci. Eng. 3(4): 225-239 (2016) - [c5]Ting He, Novella Bartolini, Hana Khamfroush, InJung Kim, Liang Ma, Tom La Porta:
Service Placement for Detecting and Localizing Failures Using End-to-End Observations. ICDCS 2016: 560-569 - 2015
- [j2]Hana Khamfroush, Daniel E. Lucani, Peyman Pahlevani, João Barros:
On Optimal Policies for Network-Coded Cooperation: Theory and Implementation. IEEE J. Sel. Areas Commun. 33(2): 199-212 (2015) - 2014
- [b1]Hana Khamfroush:
Network Coding for Cooperation in Dynamic Wireless Networks. University of Porto, Portugal, 2014 - [j1]Hana Khamfroush, Daniel Enrique Lucani, João Barros, Peyman Pahlevani:
Network-Coded Cooperation Over Time-Varying Channels. IEEE Trans. Commun. 62(12): 4413-4425 (2014) - [c4]Hana Khamfroush, Daniel Enrique Lucani, João Barros:
Network coding for wireless cooperative networks: Simple rules, near-optimal delay. ICC Workshops 2014: 255-260 - [c3]Hana Khamfroush, Peyman Pahlevani, Daniel Enrique Lucani, Martin Hundeboll, Frank H. P. Fitzek:
On the coded packet relay network in the presence of Neighbors: Benefits of speaking in a crowded room. ICC 2014: 1928-1933 - 2013
- [c2]Hana Khamfroush, Daniel E. Lucani, João Barros:
Minimizing the completion time of a wireless cooperative network using network coding. PIMRC 2013: 2016-2020 - 2011
- [c1]Hana Khamfroush, Daniel Enrique Lucani, João Barros:
GeoCode: A geographic coding-aware communication protocol. ITSC 2011: 1779-1784
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
