default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGaofeng Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Hamed Hooshangnejad, Xue Feng, Gaofeng Huang, Rui Zhang, Quan Chen, Kai Ding:
EXACT-Net: EHR-guided lung tumor auto-segmentation for non-small cell lung cancer radiotherapy. CoRR abs/2402.14099 (2024)- 2023
- [j5]Yanjiang Liu, Gaofeng Huang
, Junwei Li, Pengfei Guo, Chunsheng Zhu, Zibin Dai:
MA-GRNN:a high-efficient modeling attack approach utilizing generalized regression neural network for XOR arbiter physical unclonable functions. IEICE Electron. Express 20(13): 20230141 (2023) - [j4]Xue Feng, Kanchan Ghimire, Daniel D. Kim, Rajat S. Chandra, Helen Zhang, Jian Peng, Binghong Han, Gaofeng Huang, Quan Chen, Sohil H. Patel, Chetan Bettagowda, Haris I. Sair, Craig K. Jones, Zhicheng Jiao, Li Yang, Harrison X. Bai:
Brain Tumor Segmentation for Multi-Modal MRI with Missing Information. J. Imaging Inform. Medicine 36(5): 2075-2087 (2023) - [j3]Gaofeng Huang, Amir Hossein Jafari:
Enhanced balancing GAN: minority-class image generation. Neural Comput. Appl. 35(7): 5145-5154 (2023) - 2020
- [i1]Gaofeng Huang, Amir H. Jafari:
Enhanced Balancing GAN: Minority-class Image Generation. CoRR abs/2011.00189 (2020)
2010 – 2019
- 2014
- [c9]Lu Chen, Qing Zhou, Gaofeng Huang, Liqiang Zhang:
A Trust-Role Based Context Aware Access Control Model. CIS 2014: 371-376 - 2010
- [c8]Qing Ye, Xiaoping Wu, Yongqing Liu, Gaofeng Huang:
A Hybrid Model of RST and DST with its Application in Intrusion Detection. IITSI 2010: 202-205
2000 – 2009
- 2007
- [j2]Gaofeng Huang, Andrew Lim, Brian Rodrigues:
A local search using solution fragments for the 2-machine bicriteria scheduling problem. Comput. Optim. Appl. 37(2): 219-229 (2007) - [c7]Gaofeng Huang, Peter Jeavons, Dominic Kwiatkowski:
Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs. APBC 2007: 175-184 - [c6]Gaofeng Huang, Peter Jeavons:
A Geometrical Model for the SNP Motif Identification Problem. BIBE 2007: 395-402 - 2006
- [j1]Gaofeng Huang, Andrew Lim:
A hybrid genetic algorithm for the Three-Index Assignment Problem. Eur. J. Oper. Res. 172(1): 249-257 (2006) - 2004
- [c5]Gaofeng Huang, Andrew Lim:
An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem. ECAI 2004: 191-195 - [c4]Gaofeng Huang, Andrew Lim:
A Simple Yet Effective Framework for Optimization Problems. AI&M 2004 - 2003
- [c3]Gaofeng Huang, Andrew Lim:
A hybrid genetic algorithm for three-index assignment problem. IEEE Congress on Evolutionary Computation 2003: 2762-2768 - [c2]Gaofeng Huang, Andrew Lim:
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem. GECCO 2003: 1053-1064 - [c1]Gaofeng Huang, Andrew Lim:
Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem. ICTAI 2003: 194-
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 22:14 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:
