default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianhua Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Liangwen Yan, Ze Long, Jie Qian, Jianhua Lin, Sheng Quan Xie
, Bo Sheng:
Rehabilitation Assessment System for Stroke Patients Based on Fusion-Type Optoelectronic Plethysmography Device and Multi-Modality Fusion Model: Design and Validation. Sensors 24(9): 2925 (2024)
2010 – 2019
- 2016
- [c9]Jianhua Lin:
Optimization of Personalized Learning Pathways Based on Competencies and Outcome. ICALT 2016: 49-51 - 2013
- [c8]Xin Shi, Jianhua Lin, Yuxiang Wang, Heping Liu:
Study on the Electromagnetic Performance of Hydroelectric Generator Based on Intelligent Control. IScIDE 2013: 47-53 - [c7]Danghui Liu, Jianhua Lin, Yunxia Yin:
Error compensation model for monocular vision measurement. ROBIO 2013: 1734-1739
2000 – 2009
- 2008
- [j9]Guizhi Chen, Jianhua Lin:
A new shift scheme for the harmonic Arnoldi method. Math. Comput. Model. 48(11-12): 1701-1707 (2008) - 2002
- [j8]Yuansheng Yang, Jianhua Lin, Chunli Wang:
Three forbidden subgraphs for line graphs. Discret. Math. 252(1-3): 287-292 (2002) - [j7]Yuansheng Yang, Jianhua Lin, Chunli Wang:
Small regular graphs having the same path layer matrix. J. Graph Theory 39(4): 219-221 (2002) - 2000
- [j6]Yuansheng Yang, Jianhua Lin, Chunli Wang, Kaifeng Li:
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. Discret. Math. 211: 287-298 (2000)
1990 – 1999
- 1996
- [c6]Jianhua Lin:
Adaptive learning vector quantizers for image compression. ICIP (3) 1996: 459-462 - 1995
- [j5]Jianhua Lin:
Multiple-cost constraints for the design of tree-structured vector quantizers. IEEE Trans. Image Process. 4(6): 824-828 (1995) - [c5]Jun Zhang, Jianhua Lin:
Figure-ground separation by a neural dynamical system. ICIP 1995: 615-618 - 1994
- [j4]Jianhua Lin, James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers. Inf. Process. Manag. 30(6): 851-862 (1994) - [c4]Jianhua Lin:
An Efficient Parallel Algorithm for Vector Quantizer Design. ICPP (3) 1994: 25-30 - 1993
- [c3]Jianhua Lin, James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers. Data Compression Conference 1993: 292-301 - 1992
- [j3]Jianhua Lin, James A. Storer, Martin Cohn:
Optimal Pruning for Tree-Structured Vector Quantization. Inf. Process. Manag. 28(6): 723-734 (1992) - [c2]Jianhua Lin, James A. Storer:
Improving Search for Tree-Structured Vector Quantization. Data Compression Conference 1992: 339-348 - 1991
- [j2]Jianhua Lin, James A. Storer:
Processor-Efficient Hypercube Algorithms for the Knapsack Problem. J. Parallel Distributed Comput. 13(3): 332-337 (1991) - [j1]Jianhua Lin:
Divergence measures based on the Shannon entropy. IEEE Trans. Inf. Theory 37(1): 145-151 (1991) - [c1]Jianhua Lin, James A. Storer, Martin Cohn:
On The Complexity of Optimal Tree Pruning for Source Coding. Data Compression Conference 1991: 63-72
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-06-19 21:46 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:
