نتایج جستجو برای: additive d

تعداد نتایج: 640873  

2014
Nithin M Varma

An (α, β)-spanner of an undirected unweighted connected graph G = (V,E) is a subgraph H such that: dH(u, v) ≤ α · dG(u, v) + β, for all pairs (u, v) ∈ V × V , where dH(u, v) and dG(u, v) are the distances between u and v in H and G respectively. The quantities α and β are non negative real numbers and are called the multiplicative stretch and additive stretch of the spanner respectively. If α =...

Journal: :Journal of animal science 1991
K E Gregory L V Cundiff R M Koch

Heterosis effects for birth weight, ADG from birth to weaning, 200-d weight, ADG from weaning to 368 d, 368-d weight, 368-d height, 368-d condition score, and 368-d muscling score (males only) were evaluated separately for each sex in F1, F2, and combined F3 and F4 generations in three composite beef cattle populations. Breed effects were evaluated for the nine parental breeds (i.e., Red Poll [...

Journal: :J. Multivariate Analysis 2015
Christophe Chesneau Mohamed-Jalal Fadili Bertrand Maillot

A d-dimensional nonparametric additive regression model with dependent observations is considered. Using the marginal integration technique and wavelets methodology, we develop a new adaptive estimator for a component of the additive regression function. Its asymptotic properties are investigated via the minimax approach under the L2 risk over Besov balls. We prove that it attains a sharp rate ...

Journal: :CoRR 2017
R. Inkulu B. Sukanya

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance dw(p, q) between two points p, q ∈ S is defined as w(p) + d(p, q) + w(q) if p 6= q and it is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance between p and q. A graph G(S,E) is called a t-spanner for the additive weighted set S of points if fo...

2011
Garvesh Raskutti Martin J. Wainwright Bin Yu

Sparse additive models are families of d-variate functions that have the additive decomposition f = ∑ j∈S f ∗ j , where S is an unknown subset of cardinality s ≪ d. We consider the case where each component function f j lies in a reproducing kernel Hilbert space, and analyze an l1 kernel-based method for estimating the unknown function f . Working within a highdimensional framework that allows ...

1999
Kaisheng Yao Bertram E. Shi Pascale Fung Zhigang Cao

Using TI digits recognition experiments, we show that a combination of two dynamic speech features, Liftered Forward Masked (LFM) MFCC and 2-D cepstrum, can improve system robustness to additive Volvo noise while maintaining system performance comparable to standard MFCC features in clean conditions. Through experiments, we show that the information extracted by forward masking and by the 2D ce...

2012
PATRÍCIA GONÇALVES

Using the renormalization method introduced in [17], we prove what we call the local Boltzmann-Gibbs principle for conservative, stationary interacting particle systems in dimension d = 1. As applications of this result, we obtain various scaling limits of additive functionals of particle systems, like the occupation time of a given site or extensive additive fields of the dynamics. As a by-pro...

2003
Xiwang Cao Weisheng Qiu Cuie Tang

Very recently, J.F.Dillon, and H.Dobbertin proved that, the image set of function ∆k(x) = (x + 1) + x + 1, (where d = 2 − 2 + 1), is a new cyclic difference set in the additive group of the finite field GF (2). Using Fourier analysis on the additive group, we prove that certain sets, constructed by using Dickson polynomials, form a new cyclic difference sets with Singer parameters.

Let $A$ be a Banach ternary algebra over a scalar field $Bbb R$ or $Bbb C$ and $X$ be a ternary Banach $A$--module. Let $sigma,tau$ and $xi$ be linear mappings on $A$, a linear mapping $D:(A,[~]_A)to (X,[~]_X)$ is called a Lie ternary $(sigma,tau,xi)$--derivation, if $$D([a,b,c])=[[D(a)bc]_X]_{(sigma,tau,xi)}-[[D(c)ba]_X]_{(sigma,tau,xi)}$$ for all $a,b,cin A$, where $[abc]_{(sigma,tau,xi)}=ata...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید