Aili Han

Orcid: 0000-0002-9935-6466

According to our database1, Aili Han authored at least 22 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Semi-supervised Cross-media Feature Learning via Efficient L2, q Norm.
KSII Trans. Internet Inf. Syst., 2019

2018
IEEE Access Special Section Editorial: Recent Advantages of Computer Vision.
IEEE Access, 2018

Saliency Detection Method Using Hypergraphs on Adaptive Multiscales.
IEEE Access, 2018

Efficient Method for Locating Optic Disc in Diabetic Retinopathy Images.
Proceedings of the Biometric Recognition - 13th Chinese Conference, 2018

2017
An improved saliency detection method based on non-uniform quantification and channel-weighted color distance.
Multim. Tools Appl., 2017

An Improved Saliency Detection Method Using Hypergraphs on Adaptive Multiscales.
Proceedings of the Computer Vision - Second CCF Chinese Conference, 2017

2015
Saliency Detection Based on Non-uniform Quantification for RGB Channels and Weights for Lab Channels.
Proceedings of the Computer Vision - CCF Chinese Conference, 2015

2014
An Edge Detection Algorithm Based on Morphological Gradient and the Otsu Method.
Proceedings of the Bio-Inspired Computing - Theories and Applications, 2014

2013
A Novel Attributes Partition Method for Decision Tree.
Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications, 2013

An Improved Search Strategy for 8-Digits Puzzle.
Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications, 2013

2010
DNA solution based on triangle subgraph to the vertex cover problem.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2008
DNA Encoding Methods in the Field of DNA Computing.
Proceedings of the Computational Intelligence in Bioinformatics, 2008

DNA solution based on sequence alignment to the Minimum Spanning Tree problem.
Int. J. Bioinform. Res. Appl., 2008

An Improved DNA Solution to the Vertex Cover Problem.
Proceedings of the Fourth International Conference on Natural Computation, 2008

2007
Algorithms for the Well-Drilling Layout Problem.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2007

2006
DNA Computing Model for the Minimum Spanning Tree Problem.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

Complexity Analysis for the HEWN Algorithm.
Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), 2006

A New DNA Encoding Method for Traveling Salesman Problem.
Proceedings of the Computational Intelligence and Bioinformatics, 2006

A New DNA-Based Approach to Solve the Maximum Weight Clique Problem.
Proceedings of the Computational Intelligence and Bioinformatics, 2006

DNA Computing Model for the 0/1 Knapsack Problem.
Proceedings of the 6th International Conference on Hybrid Intelligent Systems (HIS 2006), 2006

RLM: A New Method of Encoding Weights in DNA Strands.
Proceedings of the 6th International Conference on Hybrid Intelligent Systems (HIS 2006), 2006

DNA Encoding Method of Weight for Chinese Postman Problem.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006


  Loading...