Partition problem ≈ Partition problem
View article
DeepQTMT: A Deep Learning Approach for Fast QTMT-Based CU Partition of Intra-Mode VVC Open
Versatile Video Coding (VVC), as the latest standard, significantly improves the coding efficiency over its predecessor standard High Efficiency Video Coding (HEVC), but at the expense of sharply increased complexity. In VVC, the quad-tree…
View article
Continuous Influence-Based Community Partition for Social Networks Open
Community partition is of great importance in social networks because of the rapid increasing network scale, data and applications. We consider the community partition problem under LT model in social networks, which is a combinatorial opt…
View article
Streaming graph challenge: Stochastic block partition Open
An important objective for analyzing real-world graphs is to achieve scalable\nperformance on large, streaming graphs. A challenging and relevant example is\nthe graph partition problem. As a combinatorial problem, graph partition is\nNP-h…
View article
An Improved Lower Bound for Bayesian Network Structure Learning Open
Several heuristic search algorithms such as A* and breadth-first branch and bound have been developed for learning Bayesian network structures that optimize a scoring function. These algorithms rely on a lower bound function called k-cycle…
View article
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem Open
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured consta…
View article
A fast algorithm for the spectral radii of weakly reducible nonnegative tensors Open
Summary In this paper, we propose a fast algorithm for computing the spectral radii of symmetric nonnegative tensors. In particular, by this proposed algorithm, we are able to obtain the spectral radii of weakly reducible symmetric nonnega…
View article
Nearly optimal separations between communication (or query) complexity and partitions Open
We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Göös, Pitassi, and Watson (FO…
View article
Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions Open
We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Göös, Pitassi, and Watson (FO…
View article
Multiview Ensemble Method for Detecting Shilling Attacks in Collaborative Recommender Systems Open
Faced with the evolving attacks in collaborative recommender systems, the conventional shilling detection methods rely mainly on one kind of user-generated information (i.e., single view) such as rating values, rating time, and item popula…
View article
Learning the structure of Bayesian networks with ancestral and/or heuristic partition Open
Developing efficient strategies for searching larger Bayesian networks in exact structure learning is an open challenge. In this study, ancestral and heuristic partition constraints are proposed to develop a series of exact learning algori…
View article
Bounds for partition dimension of M-wheels Open
Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances. The problem of finding exact values of partition dimension is hard so …
View article
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions Open
We present classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Our work has two main contributions: first, we modify the classical algorithm of Stefankovic, Vempala and V…
View article
A Subquadratic Approximation Scheme for Partition Open
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is …
View article
A Trajectory Partition Method Based on Combined Movement Features Open
Trajectory data mining has become an increasing concern in the location-based applications, and the trajectory partition is taken as the primary procedure of trajectory data mining. The amount of movement trajectories of nodes is typically…
View article
Reconfigurable and Traffic-Aware MAC Design for Virtualized Wireless Networks via Reinforcement Learning Open
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new col…
View article
Droop Control Optimization Strategy for Parallel Inverters in a Microgrid Based on an Improved Population Division Fruit Fly Algorithm Open
When the microgrid topology changes, the traditional droop control strategy affects the dynamic performance and steady-state accuracy of the inverter. To this end, this paper is based on an improved population division fruit fly algorithm.…
View article
Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar Open
Community detection is a fundamental problem in computational sciences with extensive applications in various fields. The most commonly used methods are the algorithms designed to maximize modularity over different partitions of the networ…
View article
A Robust Block-Jacobi Algorithm for Quadratic Programming under Lossy Communications Open
We address the problem distributed quadratic programming under lossy communications where the global cost function is the sum of coupled local cost functions, typical in localization problems and partition-based state estimation. We propos…
View article
Brain Network Regional Synchrony Analysis in Deafness Open
Deafness, the most common auditory disease, has greatly affected people for a long time. The major treatment for deafness is cochlear implantation (CI). However, till today, there is still a lack of objective and precise indicator serving …
View article
Monkey search algorithm for ECE components partitioning Open
The paper considers one of the important design problems – a partitioning of electronic computer equipment (ECE) components (blocks). It belongs to the NP-hard class of problems and has a combinatorial and logic nature. In the paper, a par…
View article
On the Isometric Path Partition Problem Open
The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (partition) number of a graph is the cardinality of …
View article
Optimization of Teaching Management System Based on Association Rules Algorithm Open
The teaching management department carries all the work related to teaching in the whole school. A scientific, efficient, and complete teaching management system cannot only help the teaching management department improve work efficiency a…
View article
The online disjoint set cover problem and its applications Open
Given a universe $U$ of $n$ elements and a collection of subsets $\mathcal{S}$ of $U$, the maximum disjoint set cover problem (DSCP) is to partition $\mathcal{S}$ into as many set covers as possible, where a set cover is defined as a colle…
View article
Minimizing Impurity Partition Under Constraints Open
Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there ex…
View article
Scheduling Based on Interruption Analysis and PSO for Strictly Periodic and Preemptive Partitions in Integrated Modular Avionics Open
Integrated modular avionics introduces the concept of partition and has been widely used in avionics industry. Partitions share the computing resources together. Partition scheduling plays a key role in guaranteeing correct execution of pa…
View article
A subquadratic approximation scheme for partition Open
The subject of this paper is the time complexity of approximating KNAPSACK, SUBSET SUM, PARTITION, and some other related problems. The main result is an O(n + 1/e5/3) time randomized FPTAS for PARTITION, which is derived from a certain re…
View article
A Max-Cut approximation using a graph based MBO scheme Open
The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a fast approximation method. Given a graph G, we want to find a cut whose size is maximal among all possible cuts. A cut is a partition of th…
View article
Influence-based Community Partition with Sandwich Method for Social Networks Open
Community partition is an important problem in many areas such as biology network, social network. The objective of this problem is to analyse the relationships among data via the network topology. In this paper, we consider the community …
View article
The Cheeger N-problem in terms of BV functions Open
We reformulate the Cheeger N partition problem as a minimization among a suitable class of BV functions. This allows us to obtain a new existence proof for the Cheeger-N-problem. Moreover, we derive some connections between the Cheeger-2- …
View article
Independent coalition in graphs: existence and characterization Open
An independent coalition in a graph G consists of two disjoint sets of vertices V1 and V2 neither of which is an independent dominating set but whose union V1 ∪ V2 is an independent dominating set. An independent coalition partition, abbre…