53 Result(s)
within
Guo Si**
Computer Science
Data Structures and Information Theory
Mathematics of Computing
-
Chapter and Conference Paper
Cloud-Edge Collaboration Based Power IoT Scene Perception Mechanism
Fast and high-quality scene perception is an important guarantee for the efficient, stable and reliable operation of the power Internet of things, which can assist the decision-making of upper-level applicatio...
-
Article
Sorting a Permutation by Best Short Swaps
A permutation is happy, if it can be transformed into the identity permutation using as many short swaps as one third times the number of inversions in the permutation. The complexity of the decision version of s...
-
Chapter and Conference Paper
Approximation Algorithms for the General Cluster Routing Problem
Graph routing problem (GRP) and its generalizations have been extensively studied because of their broad applications in the real world. In this paper, we study a variant of GRP called the general cluster rout...
-
Chapter and Conference Paper
Container Performance Prediction: Challenges and Solutions
With popularity of cloud computing services, more and more tasks and services are deployed on large-scale clusters. As an emerging technology in cloud computing field, containers make virtualization extremely ...
-
Chapter and Conference Paper
Target Coverage with Minimum Number of Camera Sensors
With the development of the smart city, camera sensors have attracted more and more research interests from both academic researchers and industrial engineers. Given a set of points of interests (POI) and a se...
-
Chapter and Conference Paper
Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in Clouds
Given a set of time slots and jobs, each of which has a degree of parallelism, an interval constraint (typically an arrival time and a deadline), and a processing time, we consider the problem of minimizing th...
-
Chapter and Conference Paper
System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing
Multi-FPGA prototype design is widely used to verify modern VLSI circuits, but the limited number of connections between FPGAs in a multi-FPGA system may cause routing failure. Therefore, using time-division m...
-
Chapter and Conference Paper
Maximizing Group Coverage in Social Networks
Groups play a crucial role in decision-making of social networks, since individual decision-making is often influenced by groups. This brings the Group Influence Maximization (GIM) problem which aims to maximi...
-
Chapter and Conference Paper
A Streaming Model for Monotone Lattice Submodular Maximization with a Cardinality Constraint
In this paper, we consider a streaming model of maximizing monotone lattice submodular function with a cardinality constraint on the integer lattice. As (lattice) submodularity does not imply the diminishing r...
-
Chapter and Conference Paper
Constrained Stable Marriage with Free Edges or Few Blocking Pairs
Given two disjoint sets U and W, where the members (also called agents) of U and W are called men and women, respectively, and each agent is associated with an ordered preference list that ranks a subset of the a...
-
Chapter and Conference Paper
Streaming Submodular Maximization Under Differential Privacy Noise
The era of big data has brought the need of fast data stream analysis. Recently the problem of streaming submodular optimization has attracted much attention due to the importance of both submodular functions ...
-
Chapter and Conference Paper
Blood Leukocyte Object Detection According to Model Parameter-Transfer and Deformable Convolution
Currently, leukocyte detection has the problem of scarcity of labeled samples, so a focal dataset must be expanded by merging multiple datasets. At the same time, given the difference in the dyeing methods, dy...
-
Article
A family of negacyclic BCH codes of length \(n=\frac {q^{2m}-1}{2}\)
In this paper, we investigate a family of q2-ary narrow-sense and non-narrow-sense negacyclic BCH codes with length n=q2m−12\(n=\frac {q^{2m}-1}{2}\), where q is an odd prime power and m ≥ 3 is odd. We propose Herm...
-
Article
Foreword: Special Issue on Parameterized and Exact Computation
-
Chapter and Conference Paper
Aggregating Multidimensional Wireless Link Information for Device-Free Localization
Device-free localization (DFL) is an emerging and promising technique, which can realize target localization without the requirement of attaching any wireless devices to targets. By analyzing the shadowing los...
-
Article
Improved domain extender for the ideal cipher
Domain extender for the ideal cipher was firstly studied by Coron et al. (TCC 2010). The construction given by them doubles the domain. To extend the domain by a factor of t > 2, recursively applying their extend...
-
Article
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments
The k-feedback arc set problem is to determine whether there is a set F of at most k arcs in a directed graph G such that the removal of F makes G acyclic. The k-feedback arc set problems in tournaments and bipar...
-
Article
The Parameterized Complexity of Local Search for TSP, More Refined
We extend previous work on the parameterized complexity of local search for the Traveling Salesperson Problem (TSP). So far, its parameterized complexity has been investigated with respect to the distance meas...
-
Article
On Finding Min-Min Disjoint Paths
The Min-Min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-hard and admits no K-approximation for any K>1 in the general case (Xu et al. in IEEE/ACM Trans....
-
Article
Editing Graphs into Disjoint Unions of Dense Clusters
In the Π-Cluster Editing problem, one is given an undirected graph G, a density measure Π, and an integer k≥0, and needs to decide whether it is possible to transform G by editing (deleting and inserting) at most...
