Results 151 to 160 of about 617,805 (269)
Three-Dimensional Ultrasound Localization Microscopy with Bipartite Graph-Based Microbubble Pairing and Kalman-Filtering-Based Tracking on a 256-Channel Verasonics Ultrasound System with a 32 × 32 Matrix Array. [PDF]
J Med Biol Eng, 2022 Lok UW +8 more
europepmc +1 more source
Linking the Comparison and Graphical Approaches to Bipartite Matching
International Statistical Review, EarlyView.Summary Bipartite record linkage has the goal of identifying observations referring to the same individual, called coreferent observations, across two distinct non‐duplicated datasets. The two main approaches to solve this task are the Fellegi–Sunter model, which relies on pairwise comparisons of observations, and the graphical record linkage model ...
Edoardo Redivo
wiley +1 more source
Bipartite graph for topic extraction [PDF]
, 2015 This article presents a bipartite graph propagation method to be applied to different tasks in the machine learning unsupervised domain, such as topic extraction and clustering.
Faleiros, Thiago de Paulo +1 more
core
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Partitioning a permutation graph: algorithms and an application. [PDF]
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core
How to optimise tournament draws: The case of the FIFA World Cup
International Transactions in Operational Research, EarlyView.Abstract The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade‐off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform ...
László Csató
wiley +1 more source
The Architecture of Consolidation: Nests of Corporate Control in the Agrochemical Network
Journal of Agrarian Change, EarlyView.ABSTRACT Research on agricultural consolidation tends to equate corporate control with the dominance of a few large firms. We take an alternative approach that examines control through the explosive growth of legally distinct firms that fragment accountability. Using a new global dataset of 6982 entities linked to BASF, Bayer, Corteva, Dow, DuPont, FMC,
Loka Ashwood +5 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1981 AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) where |A| = a ≥ 2, |B| = b ≥ k ≥ 2, and each vertex of A has degree at least k. We prove two results concerning the existence of cycles in G(a, b, k).
openaire +3 more sources
Obesity Reviews, EarlyView.ABSTRACT Bariatric surgery (BS) has short‐ and medium‐term benefits in improving metabolic syndrome (MetS) components, but its long‐term impact remains incompletely characterized. This systematic review and meta‐analysis aimed to quantify the long‐term effects of BS (≥ 5 years) on fasting blood glucose (FBG), HDL cholesterol, triglycerides (TG), waist ...
Bernardo Paz Barboza +7 more
wiley +1 more source
The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings
AKCE International Journal of Graphs and CombinatoricsA graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj +1 more source