Construction of the Smallest Common Coarser of Two and Three Set Partitions by Potůček Radovan

Subjects: “…partition of a set…”
Get full text

Consistency between ordering and clustering methods for graphs by Tatsuro Kawamoto, Masaki Ochi, Teruyoshi Kobayashi

“…To this end, we propose a measure called the label continuity error, which generically quantifies the degree of consistency between a sequence and partition for a set of elements. Based on synthetic and real-world datasets, we evaluate the extents to which an ordering method identifies a module structure and a clustering method identifies a banded structure.…”
Get full text

Tolerant Radon partitions on the all-paths convexity in graphs by Sreekumar Sreedharan, Manoj Changat

“…Convexity obtained by the all-paths transit function is called all-paths convexity. A partition of a set P of vertices of a graph G into two disjoint non-empty subsets is called a Radon partition if the convex hulls of the subsets intersect. …”
Get full text

$k$-Efficient partitions of graphs by M. Chellali, Teresa W. Haynes, Stephen T. Hedetniemi

“…In this paper, we generalize the concept of efficient domination by considering $k$-efficient domination partitions of the vertex set of $G$, where each element of the partition is a set consisting of a vertex $u_i$ and all the vertices at distance~$d_i$ from it, where $d_i \in \{0,1, \ldots, k\}$. …”
Get full text

Some properties on degenerate Fubini polynomials by Taekyun Kim, Dae San Kim, Hye Kyung Kim, Hyunseok Lee

“…The nth Fubini number enumerates the number of ordered partitions of a set with n elements and is the number of possible ways to write the Fubini formula for a summation of integration of order n. …”
Get full text

A Definition for Hesitant fuzzy Partitions by Laya Aliahmadipour, Vicenç Torra, Esfandiar Eslami, Mahdi Eftekhari

“…We define a method to construct H-fuzzy partitions from a set of fuzzy clusters obtained from several executions of fuzzy clustering algorithms with various initialization of their parameters. …”
Get full text

Método heurístico para particionamiento óptimo by Sergio Gerardo de los Cobos Silva, Javier Trejos Zelaya, Blanca Rosa Pérez Salvador, Miguel Ángel Gutiérrez Andrade

“…The present paper has two main parts; first, we present different methods and heuristics that find the number of clusters for optimal partitioning of a set; afterwards, we propose a new heuristic and we perform different comparisons in order to evaluate the advantages on well known data sets; we end the paper with some concluding remarks. …”
Get full text

A novel approach to find partitions of $ Z_{m} $ with equal sum subsets via complete graphs by M. Haris Mateen, Muhammad Khalid Mahmmod

“…In mathematics and computer sciences, the partitioning of a set into two or more disjoint subsets of equal sums is a well-known NP-complete problem, also referred to as partition problem. …”
Get full text

A VOXEL-BASED FILTERING ALGORITHM FOR MOBILE LIDAR DATA by H. Qin, G. Guan, Y. Yu, L. Zhong

“…In the first step, to improve computational efficiency, mobile LiDAR points, in xy-plane, are first partitioned into a set of two-dimensional (2-D) blocks with a given block size, in each of which all laser points are further organized into an octree partition structure with a set of three-dimensional (3-D) voxels. …”
Get full text

A pylon model for semantic segmentation by Lempitsky, V, Vedaldi, A, Zisserman, A

“…As a result of such inference, the image gets partitioned into a set of segments that may come from different layers of the tree. …”

A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences by Benson Andrew K, Way Samuel F, Russell David J, Sayood Khalid

“…The proposed clustering algorithm uses a grammar-based distance metric to determine partitioning for a set of biological sequences. The algorithm performs clustering in which new sequences are compared with cluster-representative sequences to determine membership. …”
Get full text

Destroying Bicolored $P_3$s by Deleting Few Edges by Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer

“…The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges. …”
Get full text

Roof model recommendation for complex buildings based on combination rules and symmetry features in footprints by Xuke Hu, Hongchao Fan, Alexey Noskov

“…Second, a graph-based symmetry detection algorithm is proposed to identify all the symmetrical sub-clusters in partitions. Then, a set of selection rules are defined to rank partitions, and the best ones are chosen for roof shape recommendation. …”
Get full text

A STOCHASTIC APPROACH TO AUTOMATED RECONSTRUCTION OF 3D MODELS OF INTERIOR SPACES FROM POINT CLOUDS by H. Tran, K. Khoshelham

“…The building interior is first partitioned into a set of 3D shapes as an arrangement of permanent structures. …”
Get full text

Improving the Effectiveness of the Solid-Solution-Strengthening Elements Mo, Re, Ru and W in Single-Crystalline Nickel-Based Superalloys by Tobias Gaag, Nils Ritter, Alexandra Peters, Nicklas Volz, Daniel Gruber, Steffen Neumeier, Christopher Zenk, Carolin Körner

“…To determine the composition dependency of the partitioning behavior, a set of polycrystalline superalloys with varying contents of these solid solution-strengthening elements and a W-containing single-crystalline alloy series with varying concentrations of the γ′-forming elements Ta and Ti was produced. …”
Get full text

A Data Cleaning Method for Big Trace Data Using Movement Consistency by Xue Yang, Luliang Tang, Xia Zhang, Qingquan Li

“…First, a trajectory is partitioned into a set of sub-trajectories using the movement characteristic points. …”
Get full text

Broken unitary picture of dynamics in quantum many-body scars by Pierre-Gabriel Rozon, Kartiek Agarwal

“…Specifically, we postulate that QMBS Hamiltonians H can generically be partitioned into a set of terms O_{a} which do not commute over the entire Hilbert space, but commute to all orders within the subspace of scar states. …”
Get full text

Structure-Aware Scheduling Methods for Scientific Workflows in Cloud by Alaa Albtoush, Farizah Yunus, Khaled Almi’ani, Noor Maizura Mohamad Noor

“…In the level-based approach, tasks are partitioned into a set of isolated groups in which available virtual machines (VMs) compete to execute the groups’ tasks. …”
Get full text

Energy-Efficient Clustered Cell-Free Networking With Access Point Selection by Ouyang Zhou, Junyuan Wang, Fuqiang Liu, Jiangzhou Wang

“…A new scalable clustered cell-free network architecture has been proposed recently, under which the large-scale network is flexibly partitioned into a set of independent subnetworks operating parallelly. …”
Get full text

A Distributed Barrier Coverage Mechanism for Supporting Full View in Wireless Visual Sensor Networks by Pei Xu, I-Hsiung Chang, Chih-Yung Chang, Bhargavi Dande, Chih-Yao Hsiao

“…In <italic>Region Partitioning Phase</italic>, the given <inline-formula> <tex-math notation="LaTeX">$R $ </tex-math></inline-formula> is partitioned into a set of equal-sized grids, aiming to simplify the construction problem of the full-view barrier. …”
Get full text