Results 51 to 60 of about 282,377 (316)

Mixed Alternating Projections with Application to Hankel Low-Rank Approximation

open access: yesAlgorithms, 2022
The method of alternating projections for extracting low-rank signals is considered. The problem of decreasing the computational costs while keeping the estimation accuracy is analyzed.
Nikita Zvonarev, Nina Golyandina
doaj   +1 more source

The Stable Roommates Problem with Globally-Ranked Pairs [PDF]

open access: yesInternet Mathematics, 2007
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked globally. In contrast to the unrestricted problem, weakly stable matchings are guaranteed to exist, and additionally, they can be found in polynomial time.
David J. Abraham   +3 more
openaire   +4 more sources

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

Good intermediate-rank lattice rules based on the weighted star discrepancy

open access: yes, 2006
We study the problem of constructing good intermediate-rank lattice rules in the sense of having a low weighted star discrepancy. The intermediate-rank rules considered here are obtained by “copying” rank-1 lattice rules.
Joe, Stephen, Sinescu, Vasile
core   +1 more source

Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]

open access: yes, 2013
Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core   +1 more source

Array pattern synthesis using semidefinite programming and a bisection method

open access: yesETRI Journal, 2019
In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one ...
Jong‐Ho Lee   +3 more
doaj   +1 more source

HOSVD-Based Algorithm for Weighted Tensor Completion

open access: yesJournal of Imaging, 2021
Matrix completion, the problem of completing missing entries in a data matrix with low-dimensional structure (such as rank), has seen many fruitful approaches and analyses.
Zehan Chao   +2 more
doaj   +1 more source

MITF maintains genome stability in nonmelanocyte lineages

open access: yesMolecular Oncology, EarlyView.
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir   +13 more
wiley   +1 more source

ON RANK REVERSAL OF ALTERNATIVE PROBLEM WHILE MULTICRITERIA ESTIMATING

open access: yesМіжнародний науково-технічний журнал "Проблеми керування та інформатики", 2006
The phenomenon of alternatives rank reversal is studied, appearing in rating calculation using Analytic Hierarchy Process (AHP) method. The sufficient condition is found for the rank reversal absence.
V.G. Totsenko
doaj  

Hyperspectral Image Reconstruction via Block Low-Rank and Three-Dimension Weighted Total Variation Constraint

open access: yesIEEE Access, 2019
Compressed hyperspectral image reconstruction plays an important role in hyperspectral image processing, which aims to reduce the cost of transmission and recover the hyperspectral image from a small amount of data.
Zongrui Wu   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy