default search action
Bing Su
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Bing Su 0001
— Renmin University of China, Beijing, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Mingyang Gong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335(1): 185-204 (2024) - [j28]Bing Su, Peng Jin, Yifeng Lin, Fuyang Wang:
MIDWRSeg: Acquiring Adaptive Multi-Scale Contextual Information for Road-Scene Semantic Segmentation. Comput. Informatics 43(4): 849-873 (2024) - [j27]Bing Su, Jiwu Liang:
Research on Secure Community Opportunity Network Based on Trust Model. Future Internet 16(4): 121 (2024) - [c24]Jiexin Wang, Jiahao Chen, Bing Su:
Domain-Adaptive and Subgroup-Specific Cascaded Temperature Regression for Out-of-Distribution Calibration. ICASSP 2024: 2885-2889 - 2023
- [j26]Bing Su, Ling Tong
Transmission Protocol of Emergency Messages in VANET Based on the Trust Level of Nodes. IEEE Access 11: 68243-68256 (2023) - [j25]Zhangquan Wang, Jiaxuan Huang, Kelei Miao, Xiaowen Lv, Yourong Chen
Lightweight zero-knowledge authentication scheme for IoT embedded devices. Comput. Networks 236: 110021 (2023) - [j24]Xin Liu, Yingxian Chang, Honglei Yao, Bing Su:
Secure Transmission Method of Power Quality Data in Power Internet of Things Based on the Encryption Algorithm. Int. J. Data Warehous. Min. 19(1): 1-19 (2023) - [j23]Bing Su, Jiaxuan Huang, Kelei Miao
K-Anonymity Privacy Protection Algorithm for Multi-Dimensional Data against Skewness and Similarity Attacks. Sensors 23(3): 1554 (2023) - [c23]Jiexin Wang, Jiahao Chen, Bing Su:
Toward Auto-Evaluation With Confidence-Based Category Relation-Aware Regression. ICASSP 2023: 1-5 - [c22]Dazhao Du, Bing Su, Yu Li, Zhongang Qi, Lingyu Si, Ying Shan:
Do We Really Need Temporal Convolutions in Action Segmentation? ICME 2023: 1014-1019 - 2022
- [j22]Bing Su
Distributed Optimal Control for HVAC Systems Adopting Edge Computing - Strategy, Implementation, and Experimental Validation. IEEE Internet Things J. 9(14): 11858-11867 (2022) - [j21]Chenghao Zhang, Gaofeng Meng, Bing Su, Shiming Xiang, Chunhong Pan:
Monocular contextual constraint for stereo matching with adaptive weights assignment. Image Vis. Comput. 121: 104424 (2022) - [j20]Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43(3): 571-588 (2022) - [j19]Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. 44(1): 690-722 (2022) - [j18]Yong Chen, Randy Goebel, Guohui Lin
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 44(5): 3595-3610 (2022) - [c21]Dazhao Du, Bing Su, Yu Li, Zhongang Qi, Lingyu Si, Ying Shan:
Convolutional Transformer with Similarity-based Boundary Prediction for Action Segmentation. ICTAI 2022: 855-860 - [i5]Zihan Li
Semi-WTC: A Practical Semi-supervised Framework for Attack Categorization through Weight-Task Consistency. CoRR abs/2205.09669 (2022) - [i4]Dazhao Du, Bing Su, Yu Li
Efficient U-Transformer with Boundary-Aware Loss for Action Segmentation. CoRR abs/2205.13425 (2022) - [i3]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR abs/2205.14407 (2022) - 2021
- [j17]Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su:
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158: 107387 (2021) - [c20]Ke Li, Yuan Xue, Yujie Shao, Bing Su, Yu-an Tan, Jingjing Hu:
Software Misconfiguration Troubleshooting Based on State Analysis. DSC 2021: 361-366 - 2020
- [j16]Qinge Guo
Bi-Objective Vehicle Routing for Muck Transportation in Urban Road Networks. IEEE Access 8: 114219-114227 (2020) - [j15]Bing Su, Chenhui Du
Trusted Opportunistic Routing Based on Node Trust Model. IEEE Access 8: 163077-163090 (2020) - [j14]Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin
An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146: 106574 (2020) - [j13]Yong Chen, Guohui Lin
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020) - [j12]Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - [j11]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - [j10]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803: 144-151 (2020)
2010 – 2019
- 2019
- [j9]Xiaozhou He
Efficient algorithms for computing one or two discrete centers hitting a set of line segments. J. Comb. Optim. 37(4): 1408-1423 (2019) - [j8]Yong Chen, Randy Goebel, Guohui Lin
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1): 150-164 (2019) - [c19]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW 2019: 14-25 - [c18]Yong Chen, Randy Goebel, Bing Su, Weitian Tong
A 21/16-Approximation for the Minimum 3-Path Partition Problem. ISAAC 2019: 46:1-46:20 - 2018
- [c17]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Hitting a Set of Line Segments with One or Two Discrete Centers. CCCG 2018: 85-90 - [c16]Wenchang Luo, Bing Su, Yao Xu
An Approximation Framework for Bounded Facility Location Problems. COCOON 2018: 353-364 - [c15]Fei Xiao, Fengchen Qian, Bing Su, Yuzhu Fan:
Digital Twin of Solid Rocket Motor, Problem and Challenge. ISCID (2) 2018: 7-11 - [c14]Bing Su
W-Shaped Selection for Light Field Super-Resolution. KSEM (1) 2018: 148-159 - [i2]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018) - [i1]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR abs/1812.09353 (2018) - 2017
- [j7]Yang Xu, Da-wei Hu, Bing Su:
Short-term traffic flow prediction based on optimised support vector regression. Int. J. Appl. Decis. Sci. 10(4): 305-314 (2017) - 2016
- [c13]Bing Su, Wenliang Bian:
Research on the coordination strategy in the supply chain with substituting procurement financing based on option contract. LISS 2016: 1-6 - 2015
- [j6]Yuya Higashikawa, John Augustine, Siu-Wing Cheng
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - [c12]Xingfang Zhao, Yujie Zhang, Bing Su:
Multitask Oriented GPU Resource Sharing and Virtualization in Cloud Environment. ICA3PP (2) 2015: 509-524 - 2014
- [j5]Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu:
A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. 174: 52-56 (2014) - [c11]Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. AAIM 2014: 13-22 - 2013
- [j4]Bing Su, Yinfeng Xu, Binhai Zhu:
Baseline Bounded half-Plane Voronoi Diagram. Discret. Math. Algorithms Appl. 5(3) (2013) - [c10]Siu-Wing Cheng
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC 2013: 121-132 - [c9]Xiaoyi Lan, Bing Su, Can Xu:
A Study on Online Decision Model for Information Technology Adoption. WHICEB 2013: 64 - 2010
- [c8]Bingsheng He
Comet: batched stream processing for data intensive distributed computing. SoCC 2010: 63-74 - [c7]Bing Su, Yanmei Shen, Changfei Ge:
Research on Dynamic Connectivity of Urban Road Network. ISIA 2010: 691-696
2000 – 2009
- 2009
- [j3]Peng Xiao, Yinfeng Xu, Bing Su:
Finding an anti-risk path between two nodes in undirected graphs. J. Comb. Optim. 17(3): 235-246 (2009) - [j2]Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu:
The canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2): 195-205 (2009) - [c6]Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, Wei Lin, Bing Su, Hongyi Wang, Lidong Zhou:
Wave Computing in the Cloud. HotOS 2009 - 2008
- [j1]Bing Su, Qingchuan Xu, Peng Xiao:
Finding the anti-block vital edge of a shortest path between two nodes. J. Comb. Optim. 16(2): 173-181 (2008) - [c5]Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian:
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. COCOA 2008: 417-426 - [c4]Leng Han
An SVM-Based Algorithm for Classifying Promoter-Associated CpG Islands in the Human and Mouse Genomes. ICIC (2) 2008: 975-981 - 2007
- [c3]Bing Su, Qingchuan Xu, Peng Xiao:
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes. COCOA 2007: 11-19 - 2004
- [c2]Bing Su, Yinfeng Xu:
Decision Making and Analysis for Unexpected Road Blockages. ICEB 2004: 1130-1135
1990 – 1999
- 1995
- [c1]A. Nabout, Bing Su, Hassan A. Nour Eldin:
A Novel Closed Contour Extractor, Principle and Algorithm. ISCAS 1995: 445-448
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-10-30 20:32 CET 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: