Geng Lin

Orcid: 0009-0001-6718-6757

According to our database1, Geng Lin authored at least 60 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deep Neural-Fuzzy System Algorithms with Improved Interpretability for Classification Problems.
Int. J. Fuzzy Syst., April, 2024

GaNI: Global and Near Field Illumination Aware Neural Inverse Rendering.
CoRR, 2024

2023
Inverse Global Illumination using a Neural Radiometric Prior.
Proceedings of the ACM SIGGRAPH 2023 Conference Proceedings, 2023

Doctor recommendations based on the ERNIE model.
Proceedings of the 19th International Conference on Natural Computation, 2023

OmnimatteRF: Robust Omnimatte with 3D Background Modeling.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

2022
A ranking paired based artificial bee colony algorithm for data clustering.
Int. J. Comput. Sci. Math., 2022

Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage.
Concurr. Comput. Pract. Exp., 2022

2021
Robust Feature Matching for Remote Sensing Image Registration via Linear Adaptive Filtering.
IEEE Trans. Geosci. Remote. Sens., 2021

Incorporating global multiplicative decomposition and local statistical information for brain tissue segmentation and bias field estimation.
Knowl. Based Syst., 2021

An Inexact Penalty Decomposition Method for Sparse Optimization.
Comput. Intell. Neurosci., 2021

Learning to Generate Dense Point Clouds with Textures on Multiple Categories.
Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2021

Credit Approval Prediction Based on Boruta-GBM Model.
Proceedings of the 7th International Conference on Systems and Informatics, 2021

Applying a hybrid binary harmony search algorithm for the obnoxious p-median problem.
Proceedings of the 14th International Congress on Image and Signal Processing, 2021

2020
A Hybrid Spectrum Combinational Auction Mechanism Based on a Weighted Bipartite Graph for Energy Internet in Smart Cities.
Wirel. Commun. Mob. Comput., 2020

An effective binary artificial bee colony algorithm for maximum set <i>k</i>-covering problem.
Expert Syst. Appl., 2020

Learning Generative Models using Denoising Density Estimators.
CoRR, 2020

Unified Contamination-Aware Routing Method Considering Realistic Washing Capacity Constraint in Digital Microfluidic Biochips.
IEEE Access, 2020

Joint Representation Learning of Legislator and Legislation for Roll Call Prediction.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Ant colony optimisation with local search for the bandwidth minimisation problem on graphs.
Int. J. Intell. Inf. Database Syst., 2019

A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem.
Expert Syst. Appl., 2019

A Review of Recent Advances in Image Co-Segmentation Techniques.
IEEE Access, 2019

Image Cosegmentation via Cosaliency Guided and Spline Regression.
Proceedings of the 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, 2019

A Hybrid Swarm Intelligence-Based Algorithm for Finding Minimum Positive Influence Dominating Sets.
Proceedings of the Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery - Proceedings of the 15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD 2019), Kunming, China, July 20-22, 2019, 2019

Research on College Students' Academic Early Warning System Based on PCA-SVM.
Proceedings of the Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery - Proceedings of the 15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD 2019), Kunming, China, July 20-22, 2019, 2019

Applying a binary artificial bee colony algorithm to the max-cut problem.
Proceedings of the 12th International Congress on Image and Signal Processing, 2019

2018
Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method.
Knowl. Based Syst., 2018

A Binary Particle Swarm Optimization for the Minimum Weight Dominating Set Problem.
J. Comput. Sci. Technol., 2018

A hybrid binary particle swarm optimization for the obnoxious p-median problem.
Inf. Sci., 2018

A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem.
Comput. Oper. Res., 2018

A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem.
Appl. Soft Comput., 2018

2016
An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem.
IEEE Trans. Evol. Comput., 2016

An effective discrete dynamic convexized method for solving the winner determination problem.
J. Comb. Optim., 2016

A hybrid self-adaptive evolutionary algorithm for the minimum weight dominating set problem.
Int. J. Wirel. Mob. Comput., 2016

Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem.
Eur. J. Oper. Res., 2016

An Integrated Method Based on PSO and EDA for the Max-Cut Problem.
Comput. Intell. Neurosci., 2016

2015
A memetic algorithm for the max-cut problem.
Int. J. Comput. Sci. Math., 2015

An implementation of harmony search algorithm to the set covering problem.
Proceedings of the 11th International Conference on Natural Computation, 2015

2014
An Efficient Memetic Algorithm for theMax-Bisection Problem.
IEEE Trans. Computers, 2014

2013
Max-<i>k</i>-Cut by the Discrete Dynamic Convexized Method.
INFORMS J. Comput., 2013

A framework to rapidly test SDN use-cases and accelerate middlebox applications.
Proceedings of the 38th Annual IEEE Conference on Local Computer Networks, 2013

An iterative greedy algorithm for hardware/software partitioning.
Proceedings of the Ninth International Conference on Natural Computation, 2013

Fabrication of photonic devices inside glasses by high repetition rate femtosecond lasers.
Proceedings of the 6th IEEE International Conference on Advanced Infocomm Technology, 2013

2012
A discrete dynamic convexized method for the max-cut problem.
Ann. Oper. Res., 2012

A PROBE-based algorithm for the max-cut problem.
Proceedings of the Eighth International Conference on Natural Computation, 2012

Macroflows and Microflows: Enabling Rapid Network Innovation through a Split SDN Data Plane.
Proceedings of the European Workshop on Software Defined Networking, 2012

2011
An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable.
J. Glob. Optim., 2011

A dynamic convexized method for nonconvex mixed integer nonlinear programming.
Comput. Oper. Res., 2011

2010
The Role of Networks in Cloud Computing.
Proceedings of the Handbook of Cloud Computing., 2010

2009
Cloud Computing: IT as a Service.
IT Prof., 2009

2008
Cloud Computing and IT as a Service: Opportunities and Challenges.
Proceedings of the 2008 IEEE World Congress on Services, 2008

2005
Quality of Manageability of Web Services.
Proceedings of the 2005 IEEE International Conference on Services Computing (SCC 2005), 2005

2004
Rethinking manageability - advances and emerging paradigm shifts in managing intelligent IP networks.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

Applying a service-on-demand policy management framework to an ETTx environment.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

Rethinking Manageability - Advances in the Management of IP Networks.
Proceedings of the ICETE 2004, 2004

1998
Network information models and onevision® architecture.
Bell Labs Tech. J., 1998

1996
Routing algorithms for switching networks with probabilistic traffic.
Networks, 1996

1994
Fault-Tolerant Circuit-Switching Networks.
SIAM J. Discret. Math., 1994

Parallel Algorithms for Routing in Nonblocking Networks.
Math. Syst. Theory, 1994

1992
Fault Tolerant Planar Communication Networks
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Parallel Algorithms for Routing in Non-Blocking Networks.
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991


  Loading...