default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing Leng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j7]Chen Guo
, Ming Leng, Bo Wang:
The Conditional Diagnosability of Exchanged Crossed Cube. IEEE Access 6: 29994-30004 (2018)- [j6]Chen Guo, Ming Leng, Zhifang Xiao, Shuo Peng:
Conditional Diagnosability of Exchanged Hypercube Under the MM* Model. IEEE Access 6: 61151-61162 (2018) - [j5]Shihuan Liu, Ming Leng, Peichang Ouyang:
The Visualization of Spherical Patterns with Symmetries of the Wallpaper Group. Complex. 2018: 7315695:1-7315695:8 (2018) - 2017
- [j4]Chun-Juan Ouyang, Chang-Xin Liu, Ming Leng, Huan Liu:
An OMP Steganographic Algorithm Optimized by SFLA. Int. J. Pattern Recognit. Artif. Intell. 31(1): 1754001:1-1754001:19 (2017) - [j3]Ming Leng, Lingyu Sun, Kaiqiang Guo:
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem. J. Intell. Syst. 26(3): 407 (2017) - [j2]Chun-Juan Ouyang, Ming Leng, Jie-wu Xia, Huan Liu:
Vague Sets Security Measure for Steganographic System Based on High-Order Markov Model. Secur. Commun. Networks 2017: 1790268:1-1790268:13 (2017) - 2010
- [j1]Ying Xiao, Xuange Peng, Ming Leng, Bing Zhu:
The Research of Image Collection Method for Sediment Online-Detection. J. Comput. 5(6): 893-900 (2010)
2000 – 2009
- 2009
- [c11]Ming Leng, Lingyu Sun, Songnian Yu:
An Effective Multi-level Immune Algorithm for Graph Bipartitionin. IJCBS 2009: 543-548 - [c10]Lingyu Sun, Ming Leng:
Formal Derivation of the Maximal Contiguous Subsequence Sum Problem with PAR Method. ISCID (1) 2009: 3-5 - 2008
- [c9]Qianfeng Wang, Songnian Yu, Wang Ding, Ming Leng:
Generating High-Quality Random Numbers by Cellular Automata with PSO. ICNC (7) 2008: 430-433 - 2007
- [c8]Lingyu Sun, Ming Leng, Songnian Yu:
A New Multi-level Algorithm Based on Particle Swarm Optimization for Bisecting Graph. ADMA 2007: 69-80 - [c7]Lingyu Sun, Ming Leng:
An Effective Multi-level Algorithm Based on Simulated Annealing for Bisecting Graph. EMMCVPR 2007: 1-12 - [c6]Lingyu Sun, Ming Leng:
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning. ESCAPE 2007: 60-69 - [c5]Ming Leng, Songnian Yu:
An Effective Multi-level Algorithm Based on Ant Colony Optimization for Bisecting Graph. PAKDD 2007: 138-149 - 2006
- [c4]Ming Leng, Songnian Yu:
An Effective Multi-level Algorithm for Bisecting Graph. ADMA 2006: 493-500 - [c3]Lingyu Sun, Xuemei Liu, Ming Leng:
An Effective Algorithm of Shortest Path Planning in a Static Environment. PROLAMAT 2006: 257-262 - [c2]Ming Leng, Songnian Yu, Yang Chen:
An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning. PROLAMAT 2006: 294-303 - [c1]Yang Chen, Songnian Yu, Ming Leng:
Parallel Sequence Alignment Algorithm for Clustering System. PROLAMAT 2006: 311-321
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 2025-01-21 00:00 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:
