Results 71 to 80 of about 1,650,745 (287)

A Fast Algorithm for a Weighted Low Rank Approximation

open access: yes, 2017
Matrix low rank approximation including the classical PCA and the robust PCA (RPCA) method have been applied to solve the background modeling problem in video analysis.
dutta   +6 more
core   +1 more source

AAA+ protein unfoldases—the Moirai of the proteome

open access: yesFEBS Letters, EarlyView.
AAA+ unfoldases are essential molecular motors that power protein degradation and disaggregation. This review integrates recent cryo‐electron microscopy (cryo‐EM) structures and single‐molecule biophysical data to reconcile competing models of substrate translocation.
Stavros Azinas, Marta Carroni
wiley   +1 more source

Research on correction algorithm of propagation error in wireless sensor network coding

open access: yesEURASIP Journal on Wireless Communications and Networking, 2020
It is very difficult to deal with the problem of error correction in random network coding, especially when the number of errors is more than the min-cut of the network. We combine a small field with rank-metric codes to solve this problem in this paper.
Dongqiu Zhang   +3 more
doaj   +1 more source

Cooperative Electromagnetic Data Annotation via Low-Rank Matrix Completion

open access: yesRemote Sensing, 2022
Electromagnetic data annotation is one of the most important steps in many signal processing applications, e.g., radar signal deinterleaving and radar mode analysis.
Wei Zhang   +5 more
doaj   +1 more source

Dynamic Rank Maximal Matchings

open access: yes, 2017
We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A U P,E), where A denotes a set of applicants, P is a set of posts, and there are ranks on edges
Nimbhorkar, Prajakta   +1 more
core   +1 more source

Transcriptional network analysis of PTEN‐protein‐deficient prostate tumors reveals robust stromal reprogramming and signs of senescent paracrine communication

open access: yesMolecular Oncology, EarlyView.
Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice   +16 more
wiley   +1 more source

Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset

open access: yes, 2016
Recent research on problem formulations based on decomposition into low-rank plus sparse matrices shows a suitable framework to separate moving objects from the background.
Bouwmans, Thierry   +4 more
core   +3 more sources

Identification of serum protein biomarkers for pre‐cancerous lesions associated with pancreatic ductal adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns   +10 more
wiley   +1 more source

Tensor Completion Using Kronecker Rank-1 Tensor Train With Application to Visual Data Inpainting

open access: yesIEEE Access, 2018
The problem of data reconstruction with partly sampled elements under a tensor structure, which is referred to as tensor completion, is addressed in this paper.
Weize Sun, Yuan Chen, Hing Cheung So
doaj   +1 more source

Low-Rank Inducing Norms with Optimality Interpretations

open access: yes, 2018
Optimization problems with rank constraints appear in many diverse fields such as control, machine learning and image analysis. Since the rank constraint is non-convex, these problems are often approximately solved via convex relaxations.
Giselsson, Pontus, Grussler, Christian
core   +1 more source

Home - About - Disclaimer - Privacy