![](https://dblp.org/img/logo.320x120.png)
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Hamed Nassar
aka: Hamed M. Nassar
Suez Canal University, Ismaïlia, Egypt
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 2023
- Gerges M. Salama, Safaa El-Gazar
, Rana M. Nassar, Walid El Shafai, Ashraf A. M. Khalaf, Ghada M. El Banby, Hesham F. A. Hamed, Fathi E. Abd El-Samie:
Efficient multimodal cancelable biometric system based on steganography and cryptography. Iran J. Comput. Sci. 6(2): 109-121 (2023) - Ahmed Hamed
, Mohamed Tahoun, Hamed Nassar:
KNNHI: Resilient KNN algorithm for heterogeneous incomplete data classification and K identification using rough set theory. J. Inf. Sci. 49(6): 1631-1655 (2023) - Amira Mohamed, Mohamed H. Mousa, Hamed Nassar:
Effectiveness of Guard Zone in Mitigating Interference in D2D Underlaid Cellular Networks. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 14(3): 112-124 (2023) - 2022
- Ismail Mohamed, Hassan Al-Mahdi, Mohamed Tahoun, Hamed Nassar
:
Characterization of task response time in fog enabled networks using queueing theory under different virtualization modes. J. Cloud Comput. 11: 21 (2022) - Amira S. Ibrahim, Hassan Al-Mahdi, Hamed Nassar:
Characterization of task response time in a fog-enabled IoT network using queueing models with general service times. J. King Saud Univ. Comput. Inf. Sci. 34(9): 7089-7100 (2022) - Saeed Salah
, Mohammad Nassar, Raid Zaghal, Osama Hamed:
Towards the automatic generation of Arabic Lexical Recognition Tests using orthographic and phonological similarity maps. J. King Saud Univ. Comput. Inf. Sci. 34(10 Part A): 8429-8439 (2022) - Aliaa El-Gawady
, Mohamed A. Makhlouf
, Benbella S. Tawfik
, Hamed Nassar
:
Machine Learning Framework for the Prediction of Alzheimer's Disease Using Gene Expression Data Based on Efficient Gene Selection. Symmetry 14(3): 491 (2022) - 2021
- Ahmed Hamed Attia
, Ahmed Sobhy Sherif
, Hamed Nassar
:
Distributed approach for computing rough set approximations of big incomplete information systems. Inf. Sci. 547: 427-449 (2021) - Ahmed Hamed Attia
, Hamed M. Nassar
:
Efficient feature selection for inconsistent heterogeneous information systems based on a grey wolf optimizer and rough set theory. Soft Comput. 25(24): 15115-15130 (2021) - Hamed Nassar, Gehad Taher, El-Sayed El-Hady:
Stochastic geometric modelling and simulation of cellular systems for coverage probability characterization. CoRR abs/2109.14063 (2021) - 2020
- Nasser Tamim
, Mohamed Elshrkawey
, Gamil Abdel Azim
, Hamed Nassar
:
Retinal Blood Vessel Segmentation Using Hybrid Features and Multi-Layer Perceptron Neural Networks. Symmetry 12(6): 894 (2020) - Mohamed Nassar
, Khaled Salah
, Muhammad Habib Ur Rehman
, Davor Svetinovic
:
Blockchain for explainable and trustworthy artificial intelligence. WIREs Data Mining Knowl. Discov. 10(1) (2020) - Marwa F. Mohamed
, Hamed M. Nassar
:
An energy-aware forecasting-based framework using a novel moving coordinate scheme for sensor real-time communications. Wirel. Networks 26(4): 2423-2432 (2020) - 2019
- Enas Selem
, Mohammed Fatehy, Sherine M. Abd El-Kader
, Hamed Nassar
:
THE (Temperature Heterogeneity Energy) Aware Routing Protocol for IoT Health Application. IEEE Access 7: 108957-108968 (2019) - Marwa F. Mohamed
, Mohamed Ali Ahmed, Hamed M. Nassar
:
Lightweight energy-efficient framework for sensor real-time communications. IET Commun. 13(15): 2362-2368 (2019) - Marwa F. Mohamed
, Abd El Rahman Shabayek
, Mahmoud El-Gayyar, Hamed M. Nassar
:
An adaptive framework for real-time data reduction in AMI. J. King Saud Univ. Comput. Inf. Sci. 31(3): 392-402 (2019) - 2018
- Marwa F. Mohamed
, Mahmoud El-Gayyar, Abd El Rahman Shabayek
, Hamed M. Nassar
:
Data reduction in a cloud-based AMI framework with service-replication. Comput. Electr. Eng. 69: 212-223 (2018) - 2015
- Bilal Owaidat
, Hamed Nassar
, Rola Kassem:
A shortest job first (SJF)-like scheme for efficient call handoff in mobile networks. DICTAP 2015: 216-221 - 2013
- Hassan Al-Mahdi, Hamed Nassar
, Yasser Fouad, Mohamed Ali Ahmed:
Design and Analysis of a Channel Assignment Scheme for CDMA/TDMA Mobile Networks. Wirel. Pers. Commun. 69(2): 579-599 (2013) - 2012
- Marwa F. Mohamed, Hany F. El Yamany, Mohamed K. Hussien, Nashwa M. Yhiea, Hamed M. Nassar:
An Adaptive Replication Framework for Improving the QoS of Web Services. CLOSER 2012: 283-286 - 2011
- Mohamed Taha, Tarek F. Gharib, Hamed Nassar:
DARM: Decremental Association Rules Mining. J. Intell. Learn. Syst. Appl. 3(3): 181-189 (2011) - Atef Ibrahim
, Fayez Gebali, Hamed Elsimary, Amin M. Nassar:
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm. IEEE Trans. Parallel Distributed Syst. 22(7): 1142-1149 (2011) - Atef Ibrahim
, Fayez Gebali, Hamed Elsimary, Amin M. Nassar:
New processor array architecture for scalable radix 8 montgomery modular multiplication algorithm. CCECE 2011: 389-394 - Tharwat Morsy, Jürgen Götze, Hamed Nassar
:
Using hidden convexity in structured communication problems. IPCCC 2011: 1-7 - 2010
- Tarek F. Gharib, Hamed Nassar
, Mohamed Taha
, Ajith Abraham:
An efficient algorithm for incremental mining of temporal association rules. Data Knowl. Eng. 69(8): 800-815 (2010) - Hamed Nassar, Hassan Al-Mahdi, Safa Abd El-aziz:
A simulation Study of an Addressing Protocol for Mobile Ad Hoc Networks. Egypt. Comput. Sci. J. 34(2) (2010) - Hamed Nassar
, Ghada ElTaweel, Eman Mahmoud:
A Novel Feature Extraction Scheme for Human Gait Recognition. Int. J. Image Graph. 10(4): 575-587 (2010) - 2009
- Hamed Nassar
, Hassan Al Mahdi:
Design and analysis of a TDMA call assignment scheme for cellular networks. Comput. Commun. 32(7-10): 1200-1206 (2009) - 2008
- Mohamed Taha, Hamed Nassar, Tarek F. Gharib:
ITARM: Incremental Temporal Association Rules Mining. Egypt. Comput. Sci. J. 30(3): 14-25 (2008) - Tarek F. Gharib, Mohamed Taha, Hamed Nassar:
An efficient technique for incremental updating of association rules. Int. J. Hybrid Intell. Syst. 5(1): 45-53 (2008)
skipping 8 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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.
retrieved on 2024-09-12 14:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint