H.266/VVC introduces new technologies based on previous video coding standards, including the QTMT partition structure and support for 65 angular intra-prediction modes. The introduced significantly improve efficiency, but also lead to a great increase in complexity. This paper proposes ResNet-based fast CU decision algorithm reduce complexity of VVC. First, we count analyze proportion split mo...

In this paper, we consider the use of the Dulmage-Mendelsohn decomposition and network ow on bipartite graphs to improve a graph bisection partition. Given a graph partition S; B; W ] with a vertex separator S and two disconnected components B and W , diierent strategies are considered based on the Dulmage-Mendelsohn decomposition to reduce the separator size jSj and/or the imbalance between B ...

We develop a new optimization algorithm that combines the genetic algorithm and a recently proposed global optimization algorithm called the nested partitions method. The resulting hybrid algorithm retains the global perspective of the nested partitions method and the local search capabilities of the genetic algorithm. We also present a detailed application of the new algorithm to a NP-hard pro...

this paper proposes an efficient network architecture to improve energy consumption in wireless sensor networks (wsn). the proposed architecture uses a mobile data collector to a partitioned network. the mobile data collector moves to center of each logical partition after each decision period. the mobile data collector must declare its new location by packet broadcasting to all sensor nodes. h...

Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel segment inside P . We present a 3-approximation algorithm for finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms.

MOTIVATION Accuracy testing of various pedigree reconstruction methods requires an efficient algorithm for the calculation of distance between a known partition and its reconstruction. The currently used algorithm of Almudevar and Field takes a prohibitively long time for certain partitions and population sizes. RESULTS We present an algorithm that very efficiently reduces the partition-dista...

We provide the first behavioral characterization of nested logit, a foundational and widely applied discrete-choice model, through introduction nonparametric version logit that we call “nested stochastic choice” (NSC). NSC is characterized by single axiom weakens independence irrelevant alternatives on basis revealed similarity to allow for effect. Nested an additional menu-independence axiom. ...

We show in this paper that the algorithm for solving the model checking problem with a nested depthrst search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depthrst search algorithm when partial order reduction is not used.

We show in this paper that the algorithm for solving the model checking problem with a nested depth-first search can interfere with algorithms that support partial order reduction. We introduce a revised version of the algorithm that guarantees compatibility. The change also improves the performance of the nested depth-first search algorithm when partial order reduction is not used.

Biological sequences have long been known to contain many classes of repeats. The most studied repetitive structure is the tandem repeat where many approximate copies of a common segment (the motif ) appear consecutively. In this thesis, a complex repetitive structure is investigated. This repetitive structure is called a nested tandem repeat. It consists of many approximate copies of two motif...