Results 101 to 110 of about 7,149,925 (323)
Construction of Optimal Locally Repairable Codes of Triangular Association Schemes
As a new erasure code for distributed storage systems, locally repairable codes (LRCs) can effectively realize the reliable and efficient storage of massive data.
WANG Jing, LI Jinghui, YANG Jiarong, WANG E
doaj +1 more source
Minimum Distance Lasso for robust high-dimensional regression
We propose a minimum distance estimation method for robust regression in sparse high-dimensional settings. Likelihood-based estimators lack resilience against outliers and model misspecification, a critical issue when dealing with high-dimensional noisy ...
A. Lozano, N. Meinshausen, Eunho Yang
semanticscholar +1 more source
In this paper, we address the few-shot classification task from a new perspective of optimal matching between image regions. We adopt the Earth Mover's Distance (EMD) as a metric to compute a structural distance between dense image representations to ...
Chi Zhang +3 more
semanticscholar +1 more source
Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
Non-Existence of Perfect Permutation Codes Under Crown Poset Metric
Permutation codes have been extensively investigated using various metrics such as Hamming metric, Ulam metric, Kendall $\tau $ metric, $l_{\infty }$ metric, Cayley metric etc., due to their potential applications in diverse fields such as rank ...
Rohini Baliram More, Venkatrajam Marka
doaj +1 more source
Gröbner Bases and Minimum Distance of Affine Varieties Codes
Nesse trabalho apresentamos um método para estimar a distância mínima de códigos de variedades afins. Nossa técnica usa propriedades da pegada de um ideal obtido através do aumento do ideal de definição da variedade em questão.
Cícero Carvalho
doaj +1 more source
Minimum Cuts of Distance-Regular Digraphs
In this paper, we investigate the structure of minimum vertex and edge cuts of distance-regular digraphs. We show that each distance-regular digraph $\Gamma$, different from an undirected cycle, is super edge-connected, that is, any minimum edge cut of $\Gamma$ is the set of all edges going into (or coming out of) a single vertex.
Ashkboos, Saleh +3 more
openaire +2 more sources
The Minimum Distance Estimation with Multiple Integral in Panel Data
This paper studies the minimum distance estimation problem for panel data model. We propose the minimum distance estimators of regression parameters of the panel data model and investigate their asymptotic distributions.
Kim, Jiwoong
core
On the Minimum Distance of Array-Based Spatially-Coupled Low-Density Parity-Check Codes
An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers $q$ and $m$, where $q$ is an odd prime and $m \leq q$.
Rosnes, Eirik
core +1 more source
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source

