default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeng Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Yunhu Huang, Geng Lin, De-wang Chen, Wendi Zhao:
Deep Neural-Fuzzy System Algorithms with Improved Interpretability for Classification Problems. Int. J. Fuzzy Syst. 26(3): 900-921 (2024)- [j33]Siavash Arjomand Bigdeli
, Geng Lin, L. Andrea Dunbar, Tiziano Portenier, Matthias Zwicker:
Learning Generative Models Using Denoising Density Estimators. IEEE Trans. Neural Networks Learn. Syst. 35(12): 17730-17741 (2024) - [i6]Jiaye Wu, Saeed Hadadan, Geng Lin, Matthias Zwicker, David Jacobs, Roni Sengupta:
GaNI: Global and Near Field Illumination Aware Neural Inverse Rendering. CoRR abs/2403.15651 (2024) - [i5]Alex Hanson, Allen Tu, Geng Lin, Vasu Singla, Matthias Zwicker, Tom Goldstein:
Speedy-Splat: Fast 3D Gaussian Splatting with Sparse Pixels and Sparse Primitives. CoRR abs/2412.00578 (2024) - 2023
- [c26]Geng Lin, Chen Gao, Jia-Bin Huang, Changil Kim, Yipeng Wang, Matthias Zwicker, Ayush Saraf:
OmnimatteRF: Robust Omnimatte with 3D Background Modeling. ICCV 2023: 23414-23423 - [c25]Meng Chen, Geng Lin, Jianyi Huang:
Doctor recommendations based on the ERNIE model. ICNC-FSKD 2023: 1-6 - [c24]Saeed Hadadan, Geng Lin, Jan Novák, Fabrice Rousselle, Matthias Zwicker:
Inverse Global Illumination using a Neural Radiometric Prior. SIGGRAPH (Conference Paper Track) 2023: 17:1-17:11 - [i4]Saeed Hadadan, Geng Lin, Jan Novák, Fabrice Rousselle, Matthias Zwicker:
Inverse Global Illumination using a Neural Radiometric Prior. CoRR abs/2305.02192 (2023) - [i3]Geng Lin, Chen Gao, Jia-Bin Huang, Changil Kim, Yipeng Wang, Matthias Zwicker, Ayush Saraf:
OmnimatteRF: Robust Omnimatte with 3D Background Modeling. CoRR abs/2309.07749 (2023) - 2022
- [j32]Wenjie Zou, Longkun Guo, Peihuang Huang, Geng Lin, Hengquan Mei:
Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage. Concurr. Comput. Pract. Exp. 34(2) (2022) - [j31]Haiping Xu, Zhengshan Dong, Meiqin Xu, Geng Lin:
A ranking paired based artificial bee colony algorithm for data clustering. Int. J. Comput. Sci. Math. 16(4): 389-398 (2022) - 2021
- [j30]Zhengshan Dong, Geng Lin, Nian-Dong Chen:
An Inexact Penalty Decomposition Method for Sparse Optimization. Comput. Intell. Neurosci. 2021: 9943519:1-9943519:8 (2021) - [j29]Haiping Xu, Geng Lin:
Incorporating global multiplicative decomposition and local statistical information for brain tissue segmentation and bias field estimation. Knowl. Based Syst. 223: 107070 (2021) - [j28]Xingyu Jiang, Jiayi Ma, Aoxiang Fan, Haiping Xu, Geng Lin, Tao Lu, Xin Tian:
Robust Feature Matching for Remote Sensing Image Registration via Linear Adaptive Filtering. IEEE Trans. Geosci. Remote. Sens. 59(2): 1577-1591 (2021) - [c23]Geng Lin, Zhengshan Dong, Jinyan Luo, Xiang Chen, Meiqin Xu:
Applying a hybrid binary harmony search algorithm for the obnoxious p-median problem. CISP-BMEI 2021: 1-4 - [c22]Ze Chen, Geng Lin, Xiuling Jin:
Credit Approval Prediction Based on Boruta-GBM Model. ICSAI 2021: 1-5 - [c21]Tao Hu, Geng Lin, Zhizhong Han, Matthias Zwicker:
Learning to Generate Dense Point Clouds with Textures on Multiple Categories. WACV 2021: 2169-2178 - 2020
- [j27]Zhipeng Huang, Xiqiong Bai, Tingshen Lan, Xingquan Li, Geng Lin:
Unified Contamination-Aware Routing Method Considering Realistic Washing Capacity Constraint in Digital Microfluidic Biochips. IEEE Access 8: 192867-192879 (2020) - [j26]Geng Lin, Haiping Xu, Xiang Chen, Jian Guan:
An effective binary artificial bee colony algorithm for maximum set k-covering problem. Expert Syst. Appl. 161: 113717 (2020) - [j25]Hui-Bin Feng, Zhaocai Yu, Jian Guan, Geng Lin:
A Hybrid Spectrum Combinational Auction Mechanism Based on a Weighted Bipartite Graph for Energy Internet in Smart Cities. Wirel. Commun. Mob. Comput. 2020: 8829602:1-8829602:13 (2020) - [c20]Yuqiao Yang, Xiaoqiang Lin, Geng Lin, Zengfeng Huang, Changjian Jiang, Zhongyu Wei:
Joint Representation Learning of Legislator and Legislation for Roll Call Prediction. IJCAI 2020: 1424-1430 - [i2]Siavash Arjomand Bigdeli, Geng Lin, Tiziano Portenier, L. Andrea Dunbar, Matthias Zwicker:
Learning Generative Models using Denoising Density Estimators. CoRR abs/2001.02728 (2020)
2010 – 2019
- 2019
- [j24]Haiping Xu, Geng Lin, Meiqing Wang:
A Review of Recent Advances in Image Co-Segmentation Techniques. IEEE Access 7: 182089-182112 (2019) - [j23]Geng Lin, Jian Guan, Zuoyong Li, Hui-Bin Feng:
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. Expert Syst. Appl. 135: 201-211 (2019) - [j22]Jian Guan, Geng Lin, Hui-Bin Feng:
Ant colony optimisation with local search for the bandwidth minimisation problem on graphs. Int. J. Intell. Inf. Database Syst. 12(1/2): 65-78 (2019) - [c19]Xiang Chen, Geng Lin, Meiqin Xu:
Applying a binary artificial bee colony algorithm to the max-cut problem. CISP-BMEI 2019: 1-4 - [c18]Xiang Chen, Xiuling Jin, Geng Lin:
Research on College Students' Academic Early Warning System Based on PCA-SVM. ICNC-FSKD 2019: 376-383 - [c17]Geng Lin, Jinyan Luo, Haiping Xu, Meiqin Xu:
A Hybrid Swarm Intelligence-Based Algorithm for Finding Minimum Positive Influence Dominating Sets. ICNC-FSKD 2019: 506-511 - [c16]Haiping Xu, Geng Lin, Meiqing Wang:
Image Cosegmentation via Cosaliency Guided and Spline Regression. ISPA/BDCloud/SocialCom/SustainCom 2019: 1539-1544 - [i1]Tao Hu, Geng Lin, Zhizhong Han, Matthias Zwicker:
Learning to Generate Dense Point Clouds with Textures on Multiple Categories. CoRR abs/1912.10545 (2019) - 2018
- [j21]Jian Guan, Geng Lin, Hui-Bin Feng:
A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Appl. Soft Comput. 73: 230-241 (2018) - [j20]Jian Guan, Geng Lin, Hui-Bin Feng:
A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 98: 1-12 (2018) - [j19]Geng Lin, Jian Guan:
A hybrid binary particle swarm optimization for the obnoxious p-median problem. Inf. Sci. 425: 1-17 (2018) - [j18]Geng Lin, Jian Guan:
A Binary Particle Swarm Optimization for the Minimum Weight Dominating Set Problem. J. Comput. Sci. Technol. 33(2): 305-322 (2018) - [j17]Geng Lin, Jian Guan:
Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method. Knowl. Based Syst. 142: 95-107 (2018) - 2016
- [j16]Geng Lin, Jian Guan:
An Integrated Method Based on PSO and EDA for the Max-Cut Problem. Comput. Intell. Neurosci. 2016: 3420671:1-3420671:13 (2016) - [j15]Jian Guan, Geng Lin:
Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. Eur. J. Oper. Res. 248(3): 899-909 (2016) - [j14]Geng Lin:
A hybrid self-adaptive evolutionary algorithm for the minimum weight dominating set problem. Int. J. Wirel. Mob. Comput. 11(1): 54-61 (2016) - [j13]Geng Lin, Wenxing Zhu, M. Montaz Ali:
An effective discrete dynamic convexized method for solving the winner determination problem. J. Comb. Optim. 32(2): 563-593 (2016) - [j12]Geng Lin, Wenxing Zhu, M. Montaz Ali:
An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem. IEEE Trans. Evol. Comput. 20(6): 892-907 (2016) - 2015
- [j11]Geng Lin, Wenxing Zhu:
A memetic algorithm for the max-cut problem. Int. J. Comput. Sci. Math. 6(1): 69-77 (2015) - [c15]Geng Lin:
An implementation of harmony search algorithm to the set covering problem. ICNC 2015: 200-204 - 2014
- [j10]Geng Lin, Wenxing Zhu:
An Efficient Memetic Algorithm for theMax-Bisection Problem. IEEE Trans. Computers 63(6): 1365-1376 (2014) - 2013
- [j9]Wenxing Zhu, Geng Lin, M. Montaz Ali:
Max-k-Cut by the Discrete Dynamic Convexized Method. INFORMS J. Comput. 25(1): 27-40 (2013) - [c14]Quanzhong Zhao, Geng Lin, Jianrong Qiu:
Fabrication of photonic devices inside glasses by high repetition rate femtosecond lasers. ICAIT 2013: 43-44 - [c13]Geng Lin:
An iterative greedy algorithm for hardware/software partitioning. ICNC 2013: 777-781 - [c12]Rajesh Narayanan, Geng Lin, Affan A. Syed, Saad Shafiq, Fahd Gilani:
A framework to rapidly test SDN use-cases and accelerate middlebox applications. LCN 2013: 763-770 - 2012
- [j8]Geng Lin, Wenxing Zhu:
A discrete dynamic convexized method for the max-cut problem. Ann. Oper. Res. 196(1): 371-390 (2012) - [c11]Rajesh Narayanan, Saikrishna Kotha, Geng Lin, Aimal Khan, Sajjad Rizvi, Wajeeha Javed, Hassan Khan, Syed Ali Khayam:
Macroflows and Microflows: Enabling Rapid Network Innovation through a Split SDN Data Plane. EWSDN 2012: 79-84 - [c10]Geng Lin:
A PROBE-based algorithm for the max-cut problem. ICNC 2012: 627-630 - 2011
- [j7]Wenxing Zhu, Geng Lin:
A dynamic convexized method for nonconvex mixed integer nonlinear programming. Comput. Oper. Res. 38(12): 1792-1804 (2011) - [j6]Geng Lin, Wenxing Zhu, M. Montaz Ali:
An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable. J. Glob. Optim. 50(4): 657-673 (2011) - 2010
- [p1]Geng Lin, Mac Devine:
The Role of Networks in Cloud Computing. Handbook of Cloud Computing 2010: 65-82
2000 – 2009
- 2009
- [j5]Geng Lin, David Fu, Jinzy Zhu, Glenn Dasmalchi:
Cloud Computing: IT as a Service. IT Prof. 11(2): 10-13 (2009) - 2008
- [c9]Geng Lin, Glenn Dasmalchi, Jinzy Zhu:
Cloud Computing and IT as a Service: Opportunities and Challenges. ICWS 2008: 5 - [c8]Geng Lin, Glenn Dasmalchi, Jinzy Zhu:
Cloud Computing and IT as a Service: Opportunities and Challenges. SERVICES II 2008: 6-7 - 2005
- [c7]Dejan S. Milojicic, Hai Jin, Hemant K. Jain, Heather M. Kreger, Geng Lin, William Vambenepe:
Quality of Manageability of Web Services. IEEE SCC 2005 - 2004
- [c6]Alexander Clemm, Geng Lin:
Rethinking Manageability - Advances in the Management of IP Networks. ICETE (Invited Speakers) 2004: 25-26 - [c5]Michael Cheung, Alexander Clemm, Geng Lin, Ammar Rayes:
Applying a service-on-demand policy management framework to an ETTx environment. NOMS (2) 2004: 101-114 - [c4]Alexander Clemm, Geng Lin:
Rethinking manageability - advances and emerging paradigm shifts in managing intelligent IP networks. NOMS (1) 2004: 930
1990 – 1999
- 1998
- [j4]Geng Lin, John D. Price, Tanjore K. Srinivas:
Network information models and onevision® architecture. Bell Labs Tech. J. 3(4): 208-221 (1998) - 1996
- [j3]Geng Lin, Nicholas Pippenger:
Routing algorithms for switching networks with probabilistic traffic. Networks 28(1): 21-29 (1996) - 1994
- [j2]Geng Lin, Nicholas Pippenger:
Parallel Algorithms for Routing in Nonblocking Networks. Math. Syst. Theory 27(1): 29-40 (1994) - [j1]Nicholas Pippenger, Geng Lin:
Fault-Tolerant Circuit-Switching Networks. SIAM J. Discret. Math. 7(1): 108-118 (1994) - 1992
- [c3]Nicholas Pippenger, Geng Lin:
Fault-Tolerant Circuit-Switching Networks. SPAA 1992: 229-235 - [c2]Geng Lin:
Fault Tolerant Planar Communication Networks. STOC 1992: 133-139 - 1991
- [c1]Geng Lin, Nicholas Pippenger:
Parallel Algorithms for Routing in Non-Blocking Networks. SPAA 1991: 272-277
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-20 22:57 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:
