Results 51 to 60 of about 8,222,439 (341)
, 2019 We construct a matrix $M\in R^{m\otimes d^c}$ with just $m=O(c\, \,\varepsilon^{-2}\text{poly}\log1/\varepsilon )$ rows, which preserves the norm $\|Mx\|_2=(1\pm\varepsilon)\|x\|_2$ of all $x$ in any given $ $ dimensional subspace of $ R^d$ with probability at least $1- $. This matrix can be applied to tensors $x^{(1)}\otimes\dots\otimes x^{(c)}\in
Ahle, Thomas D., Knudsen, Jakob B. T.
openaire +2 more sources
Almost optimal local well-posedness for modified Boussinesq equations
Electronic Journal of Differential Equations, 2020 In this article, we investigate a class of modified Boussinesq equations, for which we provide first an alternate proof of local well-posedness in the space $(H^s\cap L^\infty)\times (H^s\cap L^\infty)(\mathbb{R})$ ($s\geq 0$) to the one obtained by
Dan-Andrei Geba, Bai Lin
doaj
IEEE Transactions on Information Theory, 2019 The repair problem in distributed storage addresses recovery of the data encoded using an erasure code, for instance, a Reed–Solomon (RS) code. We consider the problem of repairing a single node or multiple nodes in RS-coded storage systems using the ...
Itzhak Tamo, Min Ye, A. Barg
semanticscholar +1 more source
An Almost Optimal Algorithm for Computing Nonnegative Rank [PDF]
, 2014 Here, we give an algorithm for deciding if the nonnegative rank of a matrix M of dimension m \times n$ is at most r which runs in time (nm)[superscript O(r2)]. This is the first exact algorithm that runs in time singly exponential in r.
Moitra, Ankur
core +1 more source
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We make progress in the following three problems: 1. Constructing optimal seeded non-malleable extractors, 2. Constructing optimal privacy amplification protocols with an active adversary, for any possible security parameter, 3.
Eshan Chattopadhyay, Xin Li
semanticscholar +1 more source
Continuous approximations of capacities on metric compacta
Karpatsʹkì Matematičnì Publìkacìï, 2016 A method of "almost optimal" continuous approximation of capacities on a metric compactum with possibility measures, necessity measures, or with capacities on a closed subspace, is presented.
I.D. Hlushak, O.R. Nykyforchyn
doaj +1 more source
IEEE Access, 2020 To achieve optimal voltage regulation and energy savings of an AC induction motor operating under constant-torque and variable-working-load conditions, and consider a motor's T-type and Γ-type equivalent circuit, the copper and iron losses of the ...
Zhong Bin, Ma Lili, Dong Hao
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT The pediatric hematology‐oncology fellowship training curriculum has not substantially changed since its inception. The first year of training is clinically focused, and the second and third years are devoted to scholarship. However, this current structure leaves many fellows less competitive in the current job market, resulting in ...
Scott C. Borinstein +3 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background/Objectives Osteosarcoma is a radioresistant tumor that may benefit from stereotactic body radiation therapy (SBRT) for locoregional control in metastatic/recurrent disease. We report institutional practice patterns, outcomes, toxicity, and failures in osteosarcoma patients treated with SBRT.
Jenna Kocsis +13 more
wiley +1 more source
ON THE REGULARITY OF SLE TRACE
Forum of Mathematics, Sigma, 2017 We revisit regularity of SLE trace, for all $\unicode[STIX]{x1D705}\neq 8$ , and establish Besov regularity under the usual half-space capacity ...
PETER K. FRIZ, HUY TRAN
doaj +1 more source