Longkun Guo

Jiguo Yu

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Demo: Resource Allocation for Wafer-Scale Deep Learning Accelerator.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Two-Stage Neural Network Classifier for the Data Imbalance Problem with Application to Hotspot Detection.

[BibT_eX]

[DOI]

Proceedings of the 58th ACM/IEEE Design Automation Conference, 2021

Target Coverage with Minimum Number of Camera Sensors.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds.

[BibT_eX]

[DOI]

Xuanming Xu

Proceedings of the Combinatorial Optimization and Applications, 2021

Streaming Submodular Maximization Under Differential Privacy Noise.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Pool-Based Sequential Active Learning For Regression Based on Incremental Cluster Center Selection.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Advanced Cloud and Big Data, 2021

A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

A framework for optimizing extended belief rule base systems with improved Ball trees.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2020

Task allocation for crowdsensing based on submodular optimisation.

[BibT_eX]

[DOI]

Int. J. Ad Hoc Ubiquitous Comput., 2020

Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2020

Energy-efficient non-linear k-barrier coverage in mobile sensor network.

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2020

Parametric Streaming Two-Stage Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2020

Maximizing Group Coverage in Social Networks.

[BibT_eX]

[DOI]

Yuting Zhong

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

A Streaming Model for Monotone Lattice Submodular Maximization with a Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing.

[BibT_eX]

[DOI]

Long Sun

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for the General Cluster Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Blood Leukocyte Object Detection According to Model Parameter-Transfer and Deformable Convolution.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Group Influence Maximization in Social Networks.

[BibT_eX]

[DOI]

Yuting Zhong

Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

An Improved Bregman k-means++ Algorithm via Local Search.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Efficient approximation algorithms for maximum coverage with group budget constraints.

[BibT_eX]

[DOI]

Min Li

Dachuan Xu

Theor. Comput. Sci., 2019

Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line.

[BibT_eX]

[DOI]

Sensors, 2019

Optimizing the Sensor Movement for Barrier Coverage in a Sink-Based Deployed Mobile Sensor Network.

[BibT_eX]

[DOI]

IEEE Access, 2019

On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Min-Max Movement of Sink-Based Mobile Sensors in the Plane for Barrier Coverage.

[BibT_eX]

[DOI]

Wenjie Zou

Proceedings of the 20th International Conference on Parallel and Distributed Computing, 2019

Non-linear K-Barrier Coverage in Mobile Sensor Network.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures, Algorithms and Programming, 2019

Efficient Algorithms for Constrained Clustering with Side Information.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures, Algorithms and Programming, 2019

Self-Adaptive Resource Management Framework for Software Services in Cloud.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, 2019

Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

Evaluating Connection Quality between Two Individuals in Social Networks.

[BibT_eX]

[DOI]

Yi Chen

Proceedings of the 6th International Conference on Behavioral, 2019

2018

Participant selection for t-sweep k-coverage crowd sensing tasks.

[BibT_eX]

[DOI]

World Wide Web, 2018

"t-时隙k-覆盖"群智感知任务的参与者选择方法 (Participant Selection Algorithm for t-Sweep k-Coverage Crowd Sensing Tasks).

[BibT_eX]

[DOI]

计算机科学, 2018

Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing.

[BibT_eX]

[DOI]

IEEE Access, 2018

A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Constructing Multiple Domain Taxonomy for Text Processing Tasks.

[BibT_eX]

[DOI]

Yihong Zhang

Yongrui Qin

Proceedings of the Database and Expert Systems Applications, 2018

Exact Algorithms for Finding Partial Edge-Disjoint Paths.

[BibT_eX]

[DOI]

Yunyun Deng

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2017

Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2017

Efficient data retrieval algorithms for multiple requests in MIMO wireless networks.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2017

Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane.

[BibT_eX]

[DOI]

CoRR, 2017

Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees.

[BibT_eX]

[DOI]

Pei Yao

Proceedings of the Combinatorial Optimization and Applications, 2017

Approximation Algorithms for Maximum Coverage with Group Budget Constraints.

[BibT_eX]

[DOI]

Min Li

Dachuan Xu

Proceedings of the Combinatorial Optimization and Applications, 2017

On the Complexity of Detecting k-Length Negative Cost Cycles.

[BibT_eX]

[DOI]

Peng Li

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Efficient approximation algorithms for computing k disjoint constrained shortest paths.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

NP-Completeness of the Negative k-Cycle Problem.

[BibT_eX]

[DOI]

Peng Li

CoRR, 2016

Privacy-Preserving Internet Traffic Publication.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, 2016

2015

Improved approximation algorithms for constrained fault-tolerant resource allocation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Improved approximation algorithms for computing k disjoint paths subject to two constraints.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Efficient Approximation Algorithms for the Largest Weight Data Retrieval Problem.

[BibT_eX]

[DOI]

CoRR, 2015

Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths.

[BibT_eX]

[DOI]

CoRR, 2015

A parallel SRM feature extraction algorithm for steganalysis based on GPU architecture.

[BibT_eX]

[DOI]

Comput. Sci. Inf. Syst., 2015

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees.

[BibT_eX]

[DOI]

Nianchen Zou

Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014

On the Shallow-Light Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Parallel and Distributed Computing, 2014

Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent.

[BibT_eX]

[DOI]

Nianchen Zou

Yidong Li

Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2013

On Finding Min-Min Disjoint Paths.

[BibT_eX]

[DOI]

Algorithmica, 2013

Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Improved Approximation Algorithms for Computing <i>k</i> Disjoint Paths Subject to Two Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On the complexity of the edge-disjoint min-min problem in planar digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

Improved Approximations for Shallow-Light Spanning and Steiner Trees

[BibT_eX]

[DOI]

CoRR, 2012

Constrained Fault-Tolerant Resource Allocation

[BibT_eX]

[DOI]

CoRR, 2012

Efficient Approximation Algorithms for Computing k-Disjoint Minimum Cost Paths with Delay Constraint.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Parallel and Distributed Computing, 2012

2011

A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Symposium on Parallel Architectures, 2011

Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs.

[BibT_eX]

[DOI]