搜索结果: 1-15 共查到“数学 d-distance”相关记录53条 . 查询时间(0.125 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Best subset selection via distance covariance
距离协方差 最佳子集 回归分析
2023/4/14
Best subset selection is an important problem in regression analysis,which has many applications in computer science and medicine. However, the existing best subset selection methods have some limitat...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Model-free conditional screening for ultrahigh-dimensional survival data via conditional distance correlation
条件距离 相关性 超高维 生存数据 无模型 条件筛选
2023/5/4
How to select the active variables which have significant impact on the event of interest is a very important and meaningful problem in the statistical analysis of ultrahigh-dimensional data. In many ...
FINITE TWO-DISTANCE TIGHT FRAMES
Spherical two-distance sets finite tight frames strongly regular graphs spherical 2-designs spherical designs of harmonic index 2
2015/12/10
A finite collection of unit vectors S ⊂ Rn is called a spherical two-distance set if there are two numbers a and b such that the inner products of distinct vectors from S are either a or b. We p...
Localization from Incomplete Noisy Distance Measurements
Noise the measurement the sensor network localization nuclear magnetic resonance protein conformation
2015/8/20
We consider the problem of positioning a cloud of points in the Euclidean space R d, using noisy measurements of a subset of pairwise distances. This task has applications in various areas, such as se...
MONTE CARLO SAMPLING IN DUAL SPACE FOR APPROXIMATING THE EMPIRICAL HALFSPACE DISTANCE
SPACE FOR APPROXIMATING EMPIRICAL HALFSPACE DISTANCE
2015/8/20
The Kolmogorov]Smirnov distance is an important tool for constructing confidence sets and tests in univariate problems. In multivariate
settings, an analogous role is played by the halfspace di...
Efficient distance computation using best ellipsoid fit
ellipsoid fi t geometric approximation collision detection
2015/8/12
This paper describes a method for estimating the distance between a robot and its surrounding environment using best ellipsoid fit. The method consists of the following two stages. First we approximat...
Extremal values on the eccentric distance sum of trees
Eccentric distance sum Domination number Leaves Bipartition
2012/7/11
Let $G=(V_G, E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^{d}(G) = \sum_{v\in V_G}\varepsilon_{G}(v)D_{G}(v)$, where $\varepsilon_G(v)$ is the eccentricity o...
Restricted Invertibility and the Banach-Mazur distance to the cube
Restricted Invertibility the Banach-Mazur distance cube Functional Analysis
2012/6/19
We prove a normalized version of the restricted invertibility principle obtained by Spielman-Srivastava. Applying this result, we get a new proof of the proportional Dvoretzky-Rogers factorization the...
Note on group distance magic graphs $G[C_4]$
distance magic labeling magic constant sigma labeling graph labeling Abelian group
2012/4/23
A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $...
Notes on a slice distance for singular Lp-bundles
Notes slice distance singular Lp-bundles Differential Geometry
2012/4/17
A slice distance for the class of weak abelian Lp-bundles in 3 dimensions was introduced in a previous article in collaboration with Tristan Rivi\`ere, where it was used to prove the closure of such c...
Distance sets of universal and Urysohn metric spaces
Distance sets of universal Urysohn metric spaces Combinatorics
2011/9/20
Abstract: A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$...
Distance Functions, Critical Points, and Topology for Some Random Complexes
Distance function critical points Morse index Cech complex Poisson process central limit theorem Betti numbers
2011/9/20
Abstract: For a finite set of points $P$ in $R^d$, the function $d_P:R^d \to R_+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is random. In par...
On distance distribution functions-valued submeasures related to aggregation functions
submeasure distribution function probabilistic metric space triangular norm aggregation function semi-copula lattice
2011/9/13
Abstract: Probabilistic submeasures generalizing the classical (numerical) submeasures are introduced and discussed in connection with some classes of aggregation functions. A special attention is pai...
Reverse degree distance of unicyclic graphs
Degree Distance Reverse degree distance Diameter Unicyclic graph Pendant vertices Maximum degree
2011/9/1
Abstract: The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number...
An inequality for the distance between densities of free convolutions
densities of free convolutions inequality Probability
2011/8/24
Abstract: It is shown that under some conditions the distance between densities of free convolutions of two pairs of probability measures is smaller than the maximum of the Levy distance between the c...