Jianhua Lin

According to our database1, Jianhua Lin authored at least 17 papers between 1991 and 2016.

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

2016
Optimization of Personalized Learning Pathways Based on Competencies and Outcome.
Proceedings of the 16th IEEE International Conference on Advanced Learning Technologies, 2016

2013
Error compensation model for monocular vision measurement.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2013

Study on the Electromagnetic Performance of Hydroelectric Generator Based on Intelligent Control.
Proceedings of the Intelligence Science and Big Data Engineering, 2013

2008
A new shift scheme for the harmonic Arnoldi method.
Math. Comput. Model., 2008

2002
Small regular graphs having the same path layer matrix.
J. Graph Theory, 2002

Three forbidden subgraphs for line graphs.
Discret. Math., 2002

2000
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity.
Discret. Math., 2000

1996
Adaptive learning vector quantizers for image compression.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

1995
Multiple-cost constraints for the design of tree-structured vector quantizers.
IEEE Trans. Image Process., 1995

Figure-ground separation by a neural dynamical system.
Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

1994
Design and Performance of Tree-Structured Vector Quantizers.
Inf. Process. Manag., 1994

An Efficient Parallel Algorithm for Vector Quantizer Design.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

1992
Optimal Pruning for Tree-Structured Vector Quantization.
Inf. Process. Manag., 1992

Improving Search for Tree-Structured Vector Quantization.
Proceedings of the IEEE Data Compression Conference, 1992

1991
Divergence measures based on the Shannon entropy.
IEEE Trans. Inf. Theory, 1991

Processor-Efficient Hypercube Algorithms for the Knapsack Problem.
J. Parallel Distributed Comput., 1991

On The Complexity of Optimal Tree Pruning for Source Coding.
Proceedings of the IEEE Data Compression Conference, 1991


  Loading...