 | 2002 |
|---|
| 12 |       | Yuansheng Yang,
Jianhua Lin,
Chunli Wang:
Three forbidden subgraphs for line graphs.
Discrete Mathematics 252(1-3): 287-292 (2002) |
| 2000 |
|---|
| 11 | | Yuansheng Yang,
Jianhua Lin,
Chunli Wang,
Kaifeng Li:
On Kotzig's conjecture concerning graphs with a unique regular path-connectivity.
Discrete Mathematics 211: 287-298 (2000) |
| 1995 |
|---|
| 10 | | Jun Zhang,
Jianhua Lin:
Figure-ground separation by a neural dynamical system.
ICIP 1995: 2615-2618 |
| 9 | | Jianhua Lin:
Multiple-cost constraints for the design of tree-structured vector quantizers.
IEEE Transactions on Image Processing 4(6): 824-828 (1995) |
| 1994 |
|---|
| 8 |  | Jianhua Lin:
An Efficient Parallel Algorithm for Vector Quantizer Design.
ICPP (3) 1994: 25-30 |
| 7 | | Jianhua Lin,
James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers.
Inf. Process. Manage. 30(6): 851-862 (1994) |
| 1993 |
|---|
| 6 | | Jianhua Lin,
James A. Storer:
Design and Performance of Tree-Structured Vector Quantizers.
Data Compression Conference 1993: 292-301 |
| 1992 |
|---|
| 5 | | Jianhua Lin,
James A. Storer:
Improving Search for Tree-Structured Vector Quantization.
Data Compression Conference 1992: 339-348 |
| 4 | | Jianhua Lin,
James A. Storer,
Martin Cohn:
Optimal Pruning for Tree-Structured Vector Quantization.
Inf. Process. Manage. 28(6): 723-734 (1992) |
| 1991 |
|---|
| 3 | | Jianhua Lin,
James A. Storer,
Martin Cohn:
On The Complexity of Optimal Tree Pruning for Source Coding.
Data Compression Conference 1991: 63-72 |
| 2 | | Jianhua Lin:
Divergence measures based on the Shannon entropy.
IEEE Transactions on Information Theory 37(1): 145- (1991) |
| 1 | | Jianhua Lin,
James A. Storer:
Processor-Efficient Hypercube Algorithms for the Knapsack Problem.
J. Parallel Distrib. Comput. 13(3): 332-337 (1991) |
