2008 |
20 | EE | Yiyu Yao,
Bing Zhou:
Micro and macro evaluation of classification rules.
IEEE ICCI 2008: 441-448 |
19 | EE | Bing Zhou,
Yiyu Yao:
Evaluating Information Retrieval System Performance Based on Multi-grade Relevance.
ISMIS 2008: 424-433 |
18 | EE | Bing Zhou,
Yiyu Yao:
A Logic Approach to Granular Computing.
IJCINI 2(2): 63-79 (2008) |
2007 |
17 | EE | Bing Zhou,
He-xing Wang,
Cui-rong Wang:
A Hierarchical Clustering Algorithm Based on GiST.
ICIC (3) 2007: 125-134 |
16 | EE | Yiyu Yao,
Bing Zhou:
A Logic Language of Granular Computing.
IEEE ICCI 2007: 178-185 |
15 | EE | Yiyu Yao,
Bing Zhou,
Yaohua Chen:
Interpreting Low and High Order Rules: A Granular Computing Approach.
RSEISP 2007: 371-380 |
14 | EE | Zhonghui Feng,
Bing Zhou,
Junyi Shen:
A parallel hierarchical clustering algorithm for PCs cluster system.
Neurocomputing 70(4-6): 809-818 (2007) |
2005 |
13 | EE | Jin Zheng,
Bo Li,
Bing Zhou,
Wei Li:
Fast Motion Detection Based on Accumulative Optical Flow and Double Background Model.
CIS (2) 2005: 291-296 |
12 | EE | Bing Zhou,
Shou-zhi Wei:
Use Symmetrical Color-Spatial Feature for Image Comparison.
ICITA (2) 2005: 357-360 |
2002 |
11 | EE | 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.
Operating Systems Review 36(2): 1-5 (2002) |
2001 |
10 | EE | Mark Jarvis,
Bing Zhou:
Bounded vertex coloring of trees.
Discrete Mathematics 232(1-3): 145-151 (2001) |
1998 |
9 | EE | H. L. Abbott,
D. R. Hare,
Bing Zhou:
Color-critical graphs and hypergraphs with few edges and no short cycles.
Discrete Mathematics 182(1-3): 3-11 (1998) |
1997 |
8 | EE | Bing Zhou:
Some Theorems Concerning the Star Chromatic Number of a Graph.
J. Comb. Theory, Ser. B 70(2): 245-258 (1997) |
1995 |
7 | | H. L. Abbott,
D. R. Hare,
Bing Zhou:
Large Faces in 4-Critical Planar Graphs with Minimum Degree 4.
Combinatorica 15(4): 455-467 (1995) |
6 | | H. L. Abbott,
Bing Zhou:
Some Remarks on (k-1)-Critical Subgraphs of k-Critical Graphs.
Combinatorica 15(4): 469-474 (1995) |
1994 |
5 | EE | H. L. Abbott,
Meir Katchalski,
Bing Zhou:
Proof of a conjecture of Dirac concerning 4-critical planar graphs.
Discrete Mathematics 132(1-3): 367-371 (1994) |
1992 |
4 | EE | H. L. Abbott,
Bing Zhou:
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs.
Discrete Mathematics 100(1-3): 223-228 (1992) |
1991 |
3 | | H. L. Abbott,
Bing Zhou:
The edge density of 4-critical planar graphs.
Combinatorica 11(3): 185-189 (1991) |
1988 |
2 | EE | Bing Zhou:
The maximum number of cycles in the complement of a tree.
Discrete Mathematics 69(1): 85-94 (1988) |
1 | | Bing Zhou:
Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two.
SIAM J. Discrete Math. 1(2): 260-268 (1988) |