Results 101 to 110 of about 92,304 (328)
Hierarchical and High-Girth QC LDPC Codes
, 2011 We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation.
Draper, Stark C. +2 more
core +2 more sources
Automated extraction of right whale morphometric data from drone aerial photographs
Remote Sensing in Ecology and Conservation, EarlyView.Aerial photogrammetry is a popular non‐invasive method for measuring marine mammal body size, body morphometrics, and body condition, but processing large datasets efficiently remains challenging. We developed a machine learning algorithm using Mask R‐CNN models to automatically measure body morphometrics of southern right whales from aerial ...
Chhandak Bagchi +4 more
wiley +1 more source
A New Method for Building Low-Density-Parity-Check Codes
International Journal of Technology, 2019 This paper proposes a new method for building low-density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied ...
Tehami Mohammed Amine, Djebbari Ali
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
, 2013 A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Short communication: Verifying Holstein heifer heart girth to body weight prediction equations.
Journal of Dairy Science, 2017 The estimation of Holstein heifer body weight (BW) from heart girth measurements is needed, as many farms do not have animal scales to make the management decisions that require BW.
A. Heinrichs +7 more
semanticscholar +1 more source
Extremal results regarding $K_6$-minors in graphs of girth at least 5 [PDF]
arXiv, 2010 We prove that every 6-connected graph of girth $\geq 6$ has a $K_6$-minor and thus settle the Jorgensen conjecture for graphs of girth $ \geq 6$. Relaxing the assumption on the girth, we prove that every 6-connected $n$-vertex graph of size $\geq 3 1/5 n-8$ and of girth $\geq 5$ contains a $K_6$-minor.
arxiv
Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs [PDF]
arXiv, 2021 This paper gives necessary and sufficient conditions for the Tanner graph of a quasi-cyclic (QC) low-density parity-check (LDPC) code based on the all-one protograph to have girth 6, 8, 10, and 12, respectively, in the case of parity-check matrices with column weight 4.
arxiv
Ecological Research, EarlyView.This data paper includes four types of high‐resolution digital data across 22 Japanese natural forests: digital terrain models, digital canopy height models, ortho‐mosaic photos, and crown polygons covering 151 species with 4056 individuals. Abstract Recent developments in Unmanned Aerial Vehicles (UAVs) and Light Detection and Ranging (LiDAR ...
Ryuichi Takeshige +23 more
wiley +1 more source
Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field
IEEE Access, 2020 A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang +4 more
doaj +1 more source