Остановите войну!
for scientists:
default search action
Keqin Li
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
- Keqin Li 0001 — State University of New York at New Paltz, Department of Computer Science, NY, USA
- Keqin Li 0002 — SAP Research, France (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Guoxin Han, Fuyun Liu, Jucai Deng, Weihua Bai, Xiaolin Deng, Keqin Li:
An Adaptive Vehicle Tracking Enhancement Algorithm Based on Fuzzy Interacting Multiple Model Robust Cubature Kalman Filtering. Circuits Syst. Signal Process. 43(1): 191-223 (2024) - [j43]Hongliang Li, Hairui Zhao, Ting Sun, Xiang Li, Haixiao Xu, Keqin Li:
Interference-aware opportunistic job placement for shared distributed deep learning clusters. J. Parallel Distributed Comput. 183: 104776 (2024) - 2023
- [j42]Keqin Li:
UAV mission scheduling with completion time, flight distance, and resource consumption constraints. Connect. Sci. 35(1) (2023) - [j41]Longxin Zhang, Yang Hu, Jingsheng Chen, Chuang Li, Keqin Li:
MSSIF-Net: an efficient CNN automatic detection method for freight train images. Neural Comput. Appl. 35(9): 6767-6785 (2023) - [j40]Yuanchao Yan, Bo Liu, Weiwei Lin, Yuping Chen, Keqin Li, Jiangtao Ou, Chengyuan Fan:
MCCP: Multi-Collaboration Channel Pruning for Model Compression. Neural Process. Lett. 55(3): 2777-2797 (2023) - [j39]Keqin Li, Jian Feng, Juan Zhang, Qi Xiao:
Adaptive Fusion Feature Transfer Learning Method For NILM. IEEE Trans. Instrum. Meas. 72: 1-12 (2023) - [c22]Yutao Dou, Yangtao Zheng, Dazheng Liu, Keqin Li, Sheng Xiao, Shaoliang Peng:
ParaMET: A Parallel Framework for Efficient Medical Data Extraction on Tianhe-NG Supercomputer. BIBM 2023: 488-493 - [c21]Liangrui Pan, Keqin Li, Wenjuan Liu, Liwen Xu, Zhichao Feng, Shaoliang Peng:
CVFC: Attention-Based Cross-View Feature Consistency for Weakly Supervised Semantic Segmentation of Pathology Images. BIBM 2023: 1374-1379 - [c20]Keqin Li, Xuan Yang, Ao Xie, Yulong Kan, Xu Wang, Junli Deng, Jianxiao Liu:
KtreeBnIp: An Efficient Epistasis Mining Approach Using K-tree Optimizing Bayesian Network. BIBM 2023: 2817-2824 - 2022
- [j38]Jian Feng, Keqin Li, Huaguang Zhang, Xinbo Zhang, Yu Yao:
Multichannel Spatio-Temporal Feature Fusion Method for NILM. IEEE Trans. Ind. Informatics 18(12): 8735-8744 (2022) - 2021
- [j37]Juan Zhang, Huaguang Zhang, Weihua Li, Keqin Li:
Distributed edge-event triggered consensus control for multi-agent systems by edge-based asynchronous communications. Appl. Math. Comput. 397: 125920 (2021) - [j36]Keqin Li:
On the profits of competing cloud service providers: A game theoretic approach. J. Comput. Syst. Sci. 117: 130-153 (2021) - [j35]Junlong Zhu, Qingtao Wu, Mingchuan Zhang, Ruijuan Zheng, Keqin Li:
Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks. J. Mach. Learn. Res. 22: 51:1-51:42 (2021)
2010 – 2019
- 2019
- [p1]Keqin Li:
Analytical Modeling and Optimization of an Elastic Cloud Server System. From Parallel to Emergent Computing 2019: 31-48 - 2018
- [j34]Keqin Li:
Scheduling parallel tasks with energy and time constraints on multiple manycore processors in a cloud computing environment. Future Gener. Comput. Syst. 82: 591-605 (2018) - [j33]Keqin Li:
Experimental study of energy and time constrained task scheduling with irregular speed and power levels. Sustain. Comput. Informatics Syst. 19: 61-71 (2018) - [c19]Keqin Li:
Quantitative Modeling and Analytical Calculation of Elasticity in Cloud Computing. SERA 2018: 3 - 2012
- [j32]Keqin Li:
Performance Analysis and Evaluation of Random Walk Algorithms on Wireless Networks. Int. J. Found. Comput. Sci. 23(4): 779-802 (2012) - [j31]Keqin Li:
Probing High-Capacity Peers to Reduce Download times in P2P File Sharing Systems with Stochastic Service Capacities. Int. J. Found. Comput. Sci. 23(6): 1341-1370 (2012) - 2011
- [j30]Keqin Li:
Downlink data transmission scheduling algorithms in wireless networks. Simul. Model. Pract. Theory 19(6): 1427-1444 (2011) - [j29]Keqin Li:
Cost analysis and minimization of movement-based location management schemes in wireless communication networks: a renewal process approach. Wirel. Networks 17(4): 1031-1053 (2011) - 2010
- [j28]Keqin Li:
Inapproximability Results for Wavelength Assignment in WDM Optical Networks. Informatica 21(2): 205-214 (2010) - [j27]Keqin Li:
Performance evaluation of heuristic algorithms for routing and wavelength assignment in WDM optical networks. Int. J. Parallel Emergent Distributed Syst. 25(4): 273-292 (2010) - [j26]Keqin Li:
Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channels. Int. J. Parallel Emergent Distributed Syst. 25(6): 465-488 (2010)
2000 – 2009
- 2009
- [c18]Keqin Li:
A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks. FCST 2009: 80-85 - [c17]Keqin Li:
Transmission Time Minimization Algorithms in Multihop Wireless Networks with Multiple Channels. ICDCS Workshops 2009: 145-152 - 2008
- [j25]Keqin Li:
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints. Comput. J. 51(2): 216-226 (2008) - 2006
- [j24]Keqin Li:
Optimal Period of Workload Redistribution for Dynamic Bulk Synchronous Computations in Heterogeneous Computing Systems. J. Supercomput. 35(3): 205-226 (2006) - 2005
- [j23]Keqin Li:
Topological Characteristics of Random Multihop Wireless Networks. Clust. Comput. 8(2-3): 119-126 (2005) - [j22]Keqin Li:
Scheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme. J. Inf. Sci. Eng. 21(2): 309-326 (2005) - [j21]Keqin Li:
Scheduling DAGs with random parallel tasks on binarily partitionable systems. Parallel Algorithms Appl. 20(2): 85-97 (2005) - [j20]Keqin Li:
Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks. Perform. Evaluation 60(1-4): 141-163 (2005) - 2004
- [j19]Keqin Li:
Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks. Concurr. Pract. Exp. 16(13): 1327-1351 (2004) - [j18]Keqin Li:
Average-Case Scalability Analysis Of Parallel Computations On k-Ary d-Cubes. J. Interconnect. Networks 5(1): 27-45 (2004) - [j17]Keqin Li:
Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses. Parallel Algorithms Appl. 19(4): 195-209 (2004) - [j16]Keqin Li:
Analysis of randomized load distribution for reproduction trees in linear arrays and rings. Theor. Comput. Sci. 321(2-3): 195-214 (2004) - [j15]Keqin Li:
Probabilistic Analysis of Cyclic Packet Transmission Scheduling in WDM Optical Networks. Telecommun. Syst. 25(1-2): 51-64 (2004) - [c16]Keqin Li:
Probabilistic Analysis of Wavelength Assignment in WDM Optical Networks with Random Connection Requests. Communications in Computing 2004: 113-119 - [c15]Keqin Li:
Performance Evaluation of Heuristic Algorithms for Wavelength Assignment in WDM Optical Networks. ICPP Workshops 2004: 399-406 - [c14]Jianping Zheng, Keqin Li, Zhimei Wu:
Selection algorithms for anycast relay routing. IPCCC 2004: 21-27 - 2003
- [j14]Keqin Li:
Speed-up of Parallel Processing of Divisible Loads on k-dimensional Meshes and Tori. Comput. J. 46(6): 625-631 (2003) - [j13]Keqin Li:
Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks. Clust. Comput. 6(1): 47-55 (2003) - [j12]Keqin Li:
Optimal Allocation of Heterogeneous Robots in World Wide Web Search Engines. Int. J. Comput. Math. 80(8): 945-956 (2003) - [j11]Keqin Li:
On the Performance of Randomized Embedding of Reproduction Trees in Static Networks. Int. J. Parallel Program. 31(5): 393-406 (2003) - [c13]Keqin Li:
Upper Bounds for Wavelength Assignment in WDM Optical Networks Using a Random Graph Model. Communications in Computing 2003: 169-175 - [c12]Keqin Li:
Lower Bounds for Wavelength Assignment in WDM Optical Networks Using a Random Graph Model. Communications in Computing 2003: 205-211 - [c11]Keqin Li:
Topological Characteristics of Random Multihop Wireless Networks. ICDCS Workshops 2003: 685-690 - 2002
- [j10]Keqin Li:
Fast and Scalable Parallel Algorithms for Matrix Chain Product and Matrix Powers on Reconfigurable Pipelined Optical Buses. J. Inf. Sci. Eng. 18(5): 713-727 (2002) - 2001
- [j9]Keqin Li:
An Efficient Job Scheduling Algorithm in Partitionable Mesh Connected Systems. Int. J. Found. Comput. Sci. 12(6): 763-773 (2001) - [j8]Keqin Li, Victor Y. Pan:
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. IEEE Trans. Computers 50(5): 519-525 (2001) - 2000
- [j7]Keqin Li:
A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes. Int. J. Found. Comput. Sci. 11(2): 207-230 (2000) - [c10]Keqin Li:
Probabilistic Analysis of Cyclic Packet Transmission Scheduling in WDM Optical Networks. ICPP 2000: 531-540
1990 – 1999
- 1999
- [j6]Keqin Li:
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks. Discret. Math. Theor. Comput. Sci. 3(4): 155-166 (1999) - [j5]Keqin Li:
Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks. J. Comb. Optim. 3(1): 73-88 (1999) - [c9]Keqin Li, Victor Y. Pan:
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. IPPS/SPDP 1999: 31-35 - 1998
- [j4]Keqin Li:
Optimizing Average Job Response Time via Decentralized Probabilistic Job Dispatching in Heterogeneous Multiple Computer Systems. Comput. J. 41(4): 223-230 (1998) - [c8]Keqin Li:
Asymptotically Optimal Randomized Tree Embedding in Static Networks. IPPS/SPDP 1998: 423-430 - [c7]Keqin Li:
Performance evaluation of probabilistic tree embedding in cube-connected cycles. SAC 1998: 584-592 - [c6]Keqin Li:
Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information. SAC 1998: 613-622 - 1997
- [j3]Keqin Li:
Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms. Parallel Algorithms Appl. 10(3-4): 271-281 (1997) - [j2]Keqin Li:
Stochastic Bounds for Parallel Program Execution Times with Processor Constraints. IEEE Trans. Computers 46(5): 630-636 (1997) - [j1]Keqin Li:
Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System. J. Supercomput. 11(4): 391-403 (1997) - [c5]Keqin Li:
Determining the Expected Load of Dynamic Tree Embeddings in Hypercubes. ICDCS 1997: 508-515 - [c4]Keqin Li:
An efficient and effective performance evaluation method for multiprogrammed multiprocessor systems. SAC 1997: 478-487 - [c3]Keqin Li:
Analyzing the expected execution times of parallel programs. SAC 1997: 488-495 - [c2]Keqin Li:
On dynamic tree growing in hypercubes. SAC 1997: 496-503 - 1995
- [c1]Keqin Li:
Stochastic bounds for parallel program execution times with processor constraints. SPDP 1995: 208-213
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-05-08 03:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint