Results 41 to 50 of about 87,394 (276)

Sparse Approximation and Recovery by Greedy Algorithms [PDF]

IEEE Transactions on Information Theory, 2014
We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random $K$-sparse signals within $\lceil K(1+\e)\rceil$ iterations of the Orthogonal Matching Pursuit (OMP). This result shows that in a probabilistic sense the OMP is almost optimal for exact recovery.
Livshitz, Eugene, Temlyakov, Vladimir
openaire   +2 more sources

The Efficacy and Safety of Bevacizumab/Irinotecan/Temozolomide (BIT) for Relapsed/Refractory Neuroblastoma: The UK Children's Cancer and Leukaemia Group Experience

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Patients with high‐risk neuroblastoma who either are refractory to induction chemotherapy or relapse following multi‐modal treatment have a dismal prognosis. Based on data from the BEACON trial, since 2021 the UK national guidelines recommend bevacizumab, irinotecan, and temozolomide (BIT) for patients with relapsed/refractory ...
Thomas J. Jackson, Menna Shamma, Upeka Senanayake, Shaimaa Sahmoud, Kathleen Duffin, Victoria Howard, David King, Ayesha Fathani, Blanche Lumb, Andrei Pobischan, Irum Latif Memon, Monzir Ahmed, Rhian Thomas, Gerard Millen, Yasmeen Alomari, Sucheta Vaidya, Lynley V. Marshall, Sally L. George, Ramya Ramanujachar, Juliet Gray, Paola Angelini   +20 more
wiley   +1 more source

Charger Deployment Optimization in Wireless Rechargeable Sensor Network [PDF]

Jisuanji gongcheng, 2018
In order to minimize the charging cost in wireless sensor networks,two wireless charger location optimization algorithms are designed according to the location and topological features of sensor nodes:approximate algorithm and cluster partitioning ...
WANG Zhifang,ZHENG Lin,LI Xiaoji
doaj   +1 more source

Efficient Pre-Solve Algorithms for the Schwerin and Falkenauer_U Bin Packing Benchmark Problems for Getting Optimal Solutions with High Probability

Mathematics, 2021
Bin Packing is one of the research areas of Operations Research with many industrial applications, as well as rich theoretical impact. In this article, the authors deal with Bin Packing on the practical side: they consider two Bin Packing Benchmark ...
Gyula Ábrahám, György Dósa, Tibor Dulai, Zsolt Tuza, Ágnes Werner-Stark   +4 more
doaj   +1 more source

Sparse Approximation by Greedy Algorithms [PDF]

, 2016
It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse approximation with respect to the trigonometric system, (3) sparse approximation with respect to dictionaries with ...
openaire   +2 more sources

Convergence of greedy approximation I. General systems [PDF]

Studia Mathematica, 2003
Summary: We consider convergence of thresholding type approximations with regard to general complete minimal systems \(\{e_n\}\) in a quasi-Banach space \(X\). Thresholding approximations are defined as follows. Let \(\{e_n^*\}\subset X^*\) be the conjugate (dual) system to \(\{e_n\}\); then define for \(\varepsilon >0\) and \(x\in X\) the thresholding
Konyagin, S. V., Temlyakov, V. N.
openaire   +2 more sources

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

FEBS Letters, EarlyView.
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho, Shin Morioka, Junko Sasaki, Takehiko Sasaki   +3 more
wiley   +1 more source

Simultaneous sparse approximation via greedy pursuit [PDF]

, 2005
A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary signals drawn from a large, linearly dependent collection.
Gilbert, A. C., Strauss, M. J., Tropp, J. A.   +2 more
core  

Typical Approximation Performance for Maximum Coverage Problem

, 2018
This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs.
Hukushima, Koji, Maehara, Takanori, Takabe, Satoshi   +2 more
core   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

FEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy, Trina Dykstra‐MacPherson, Mathias A. Bell, Peter L. Davies, Ruby May A. Sullan   +4 more
wiley   +1 more source