default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHatem A. Fayed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Sara S. Sherif
, Doaa M. Shawky, Hatem A. Fayed:
An Ensemble Model for Stance Detection in Social Media Texts. Int. J. Inf. Technol. Decis. Mak. 22(2): 737-775 (2023)- 2021
- [j11]Hatem A. Fayed, Amir F. Atiya:
Decision boundary clustering for efficient local SVM. Appl. Soft Comput. 110: 107628 (2021) - 2020
- [j10]Mohamed El Kerdawy, Mohamed El Halaby, Afnan Hassan, Mohamed Maher, Hatem A. Fayed, Doaa Shawky, Ashraf H. Badawi:
The Automatic Detection of Cognition Using EEG and Facial Expressions. Sensors 20(12): 3516 (2020) - 2019
- [j9]Hatem A. Fayed, Amir F. Atiya:
Speed up grid-search for parameter selection of support vector machines. Appl. Soft Comput. 80: 202-210 (2019) - [j8]Dina Elreedy, Amir F. Atiya, Hatem A. Fayed, Mohamed Saleh:
A framework for an agent-based dynamic pricing for broadband wireless price rate plans. J. Simulation 13(2): 96-110 (2019) - 2014
- [j7]Hatem A. Fayed, Amir F. Atiya:
An evaluation of the integral of the product of the error function and the normal probability density with application to the bivariate normal integral. Math. Comput. 83(285): 235-250 (2014) - [j6]Hatem A. Fayed, Amir F. Atiya:
A novel series expansion for the multivariate normal probability integrals based on Fourier series. Math. Comput. 83(289): 2385-2402 (2014) - 2013
- [j5]Hatem A. Fayed, Amir F. Atiya:
A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems. Comput. Optim. Appl. 54(3): 675-703 (2013) - [j4]Hatem A. Fayed, Amir F. Atiya:
Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems. Comput. Optim. Appl. 54(3): 705 (2013) - 2009
- [j3]Hatem A. Fayed, Amir F. Atiya, Sherif Hashem:
Hyperspherical Prototypes for Pattern Classification. Int. J. Pattern Recognit. Artif. Intell. 23(8): 1549-1575 (2009) - [j2]Hatem A. Fayed, Amir F. Atiya:
A Novel Template Reduction Approach for the K -Nearest Neighbor Method. IEEE Trans. Neural Networks 20(5): 890-896 (2009) - 2007
- [j1]Hatem A. Fayed, Sherif Hashem, Amir F. Atiya:
Self-generating prototypes for pattern classification. Pattern Recognit. 40(5): 1498-1509 (2007)
Conference and Workshop Papers
- 2018
- [c3]Sara S. Mourad, Doaa M. Shawky, Hatem A. Fayed, Ashraf H. Badawi:
Stance Detection in Tweets Using a Majority Vote Classifier. AMLTA 2018: 375-384 - [c2]Hatem A. Fayed:
A data reduction approach using hyperspherical sectors for support vector machine. DSIT 2018: 144-148 - 2006
- [c1]Amir F. Atiya, Sherif Hashem, Hatem A. Fayed:
Pattern Classification Using a Set of Compact Hyperspheres. ICONIP (2) 2006: 116-123
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 2025-01-21 00:12 CET 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:
