Demo Data from EDBT 2026 / reviewers in the wild / expert
Bin Cong
dblp:87/5862
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › graph embedding
network topology embedding |
0.0 | 1 | 1996 | Embedding Star Networks into Hypercubes · IEEE Trans. Computers 1996 |
Interconnection networks and networks-on-chip › network topology › hypercubic networks
hypercube |
0.0 | 1 | 1996 | Embedding Star Networks into Hypercubes · IEEE Trans. Computers 1996 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1996 | Embedding Star Networks into Hypercubes · IEEE Trans. Computers 1996 |
Methods — techniques the papers use, named apart from their topics
dilation-expansion tradeoff analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Camshift Target Tracking Based on Gaussian Background Difference and Adaboost Combination
Bin Cong, Zhefu Wang |
CISIS | 1 |
| 1996 | Embedding Star Networks into HypercubesabstractThe star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes. Our embeddings exhibit a marked trade off between dilation and expansion. For the n dimensional star network we exhibit: (1) a dilation N-1 embedding of S/sub n/ into H/sub n/, where N=[log/sub 2/(n!)]; (2) a dilation 2(d+1) embedding of S/sub n/ into H/sub 2d+n-1/ where d=[log/sub 2/([n/2]!)]; (3) a dilation 2d+2i embedding of S(2/sup i/m) into H(2/sup i/d+i2/sup i/m-2i+1) where d=[log/sub 2/(m!)]; (4) a dilation L embedding of S/sub n/ into H/sub d/, where L=1+[log/sub 2/(n!)], and d=(n-1)L; (5) a dilation (k+1)(k+2)/2 embedding of S/sub n/ into H(n(k+1)-2/sup k+1/+1) where k=[log/sub 2/(n-1)]; (6) a dilation 3 embedding of S/sub 2k+1/ into H(2k/sup 2/+k); and (7) a dilation 4 embedding of S/sub 3k+2/ into H(3k/sup 2/+3k+1). Some of the embeddings are in fact optimum, in both dilation and expansion for small values of n. We also show that the embedding of S/sub n/ into its optimum hypercube requires dilation /spl Omega/(log/sub 2/ n). Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough |
IEEE Trans. Computers | 2 |
| 1993 | The 4-Star Graph is not a Subgraph of Any Hypercube
Xiaojun Shen 0002, Qing Hu 0007, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb |
Inf. Process. Lett. | 3 |
| 1992 | Simulation Permutation Networks on Hypercubes
Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough |
LATIN | 2 |