Search the dblp DataBase

Publications of Author

1. Jin Zheng, Bo Li, Bing Zhou, Wei Li
   Fast Motion Detection Based on Accumulative Optical Flow and Double Background Model. [Citation Graph (0, 0)][DBLP]
   CIS (2), 2005, pp:291-296 [Conf]
   
2. Bing Zhou, Shou-zhi Wei
   Use Symmetrical Color-Spatial Feature for Image Comparison. [Citation Graph (0, 0)][DBLP]
   ICITA (2), 2005, pp:357-360 [Conf]
   
3. H. L. Abbott, D. R. Hare, Bing Zhou
   Large Faces in 4-Critical Planar Graphs with Minimum Degree 4. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1995, v:15, n:4, pp:455-467 [Journal]
   
4. H. L. Abbott, Bing Zhou
   The edge density of 4-critical planar graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1991, v:11, n:3, pp:185-189 [Journal]
   
5. H. L. Abbott, Bing Zhou
   Some Remarks on (k-1)-Critical Subgraphs of k-Critical Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1995, v:15, n:4, pp:469-474 [Journal]
   
6. Mark Jarvis, Bing Zhou
   Bounded vertex coloring of trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:232, n:1-3, pp:145-151 [Journal]
   
7. Zhonghui Feng, Bing Zhou, Junyi Shen
   A parallel hierarchical clustering algorithm for PCs cluster system. [Citation Graph (0, 0)][DBLP]
   Neurocomputing, 2007, v:70, n:4-6, pp:809-818 [Journal]
   
8. Bing Zhou
   Some Theorems Concerning the Star Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:245-258 [Journal]
   
9. Bing Zhou
   Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:2, pp:260-268 [Journal]
   
10. Rimon Barr, John C. Bicket, Daniel S. Dantas, Bowei Du, T. W. Danny Kim, Bing Zhou, Emin Gün Sirer
    On the need for system-level support for ad hoc and sensor networks. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 2002, v:36, n:2, pp:1-5 [Journal]
    
11. Yiyu Yao, Bing Zhou, Yaohua Chen
    Interpreting Low and High Order Rules: A Granular Computing Approach. [Citation Graph (0, 0)][DBLP]
    RSEISP, 2007, pp:371-380 [Conf]
    
12. Bing Zhou
    The maximum number of cycles in the complement of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:85-94 [Journal]
    
13. H. L. Abbott, D. R. Hare, Bing Zhou
    Color-critical graphs and hypergraphs with few edges and no short cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:3-11 [Journal]
    
14. H. L. Abbott, Bing Zhou
    On a conjecture of Gallai concerning complete subgraphs of k-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:100, n:1-3, pp:223-228 [Journal]
    
15. H. L. Abbott, Meir Katchalski, Bing Zhou
    Proof of a conjecture of Dirac concerning 4-critical planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:367-371 [Journal]
    
16. 
    A Logic Language of Granular Computing. [Citation Graph (, )][DBLP]
    
    
17. 
    Micro and macro evaluation of classification rules. [Citation Graph (, )][DBLP]
    
    
18. 
    A Three-Way Decision Approach to Email Spam Filtering. [Citation Graph (, )][DBLP]
    
    
19. 
    A Hierarchical Clustering Algorithm Based on GiST. [Citation Graph (, )][DBLP]
    
    
20. 
    Evaluating Information Retrieval System Performance Based on Multi-grade Relevance. [Citation Graph (, )][DBLP]
    
    
21. 
    On a construction of graphs with high chromatic capacity and large girth. [Citation Graph (, )][DBLP]