Results 61 to 70 of about 428,558 (290)
3-D Beamforming Training Using Mutually Unbiased Bases for Cell Discovery in mm-Wave Systems
IEEE Access, 2023 Beamforming training or cell discovery (CD) is a fundamental procedure in millimeter wave communication systems in which the user detects the presence of a base station, acquires the identity of that base station, and finds suitable beamforming ...
P. Rashmi, A. Manoj, Arun Pachai Kannu
doaj +1 more source
Convergence of densities of some functionals of Gaussian processes [PDF]
, 2013 The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density.
Hu, Yaozhong, Lu, Fei, Nualart, David
core
Growth of maps, distortion in groups and symplectic geometry
, 2000 In the present paper we study two sequences of real numbers associated to a symplectic diffeomorphism: the uniform norm of the differential of its n-th iteration and the word length of its n-th iteration.
Polterovich, Leonid
core +2 more sources
A non-uniform Datko–Pazy theorem for bounded operator semigroups
Studia MathematicaWe present a non-uniform analogue of the classical Datko-Pazy theorem. Our main result shows that an integrability condition imposed on orbits originating in a fractional domain of the generator (as opposed to all orbits) implies polynomial stability of a bounded $C_0$-semigroup.
Paunonen L, Seifert D, Vanspranghe N
openaire +3 more sources
Molecular 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
Visibility maps of realistic terrains have linear smoothed complexity
Journal of Computational Geometry, 2010 We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility map of such a terrain with n triangles is Θ(n2) in the worst case. We prove
Mark de Berg +2 more
doaj +1 more source
Density of integer solutions to diagonal quadratic forms
, 2007 Let Q be a non-singular diagonal quadratic form in at least four variables. We provide upper bounds for the number of integer solutions to the equation Q=0, which lie in a box with sides of length 2B, as B tends to infinity.
Browning, T. D.
core +1 more source
Molecular Oncology, EarlyView.We show that the majority of the 18 analyzed recurrent cancer‐associated ERBB4 mutations are transforming. The most potent mutations are activating, co‐operate with other ERBB receptors, and are sensitive to pan‐ERBB inhibitors. Activating ERBB4 mutations also promote therapy resistance in EGFR‐mutant lung cancer.
Veera K. Ojala +15 more
wiley +1 more source
Bounds for Approximation in Total Variation Distance by Quantum Circuits [PDF]
, 1995 It was recently shown that for reasonable notions of approximation of states and functions by quantum circuits, almost all states and functions are exponentially hard to approximate [Knill 1995].
Knill, E.
core +3 more sources
Towards a complexity theory for the congested clique
, 2018 The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for
Balliu Alkida +11 more
core +1 more source