نتایج جستجو برای: yi

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

Journal: :Adv. Comput. Math. 2010
Allal Guessab Gerhard Schmeisser

Let ⊂ Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal properties of those positive definite formulae that can be generated by a centroidal Voronoi tessellation of . In this connection we come across a class of operators of the form Ln[ f ](x) := ∑n i=1 φi(x)( f (yi)+ 〈∇ f (yi),...

2000
M. Fabbrichesi

In (5), GF is the Fermi coupling, the functions zi(μ) and yi(μ) are the Wilson coefficients and τ = −VtdV ∗ ts/VudV ∗ us. According to the standard parameterization of the CKM matrix, in order to determine ε/ε , we only need to consider the yi(μ) components, which control the CP -violating part of the lagrangian. The coefficients yi(μ), and zi(μ) contain all the dependence of short-distance phy...

2013
Marius Kloft

Problem setting. In statistical learning theory (SLT), the goal is to find a classifier g : Rd → {0, 1}, predicting the correct class y of an observation x ∈ Rd, based on data (x1, y1), . . . , (xn, yn). Clearly, we cannot learn any reasonable classifier, if no assumption is imposed on the relationship between the data and the test observation (x, y). To this end, we assume in SLT that the data...

Journal: :Math. Oper. Res. 1997
Masayuki Shida Susumu Shindoh Masakazu Kojima

Let C be a full dimensional, closed, pointed and convex cone in a nite dimensional real vector space E with an inner product hx;yi of x; y 2 E , andM a maximal monotone subset of E E . This paper studies the existence and continuity of centers of the monotone generalized complementarity problem associated with C and M: Find (x;y) 2 M\ (C C ) such that hx;yi = 0. Here C = fy 2 E : hx;yi 0 for al...

1992
René Peralta RENE PERALTA

Let P be a prime number and al, at be distinct integers modulo P. Let x be chosen at random with uniform distribution in Zp , and let yi = x + ai . We prove that the joint distribution of the quadratic characters of the yi 's deviates from the distribution of independent fair coins by no more than t(3 + xfi-)/P. That is, the probability of (Yi, ...Y, t) matching any particular quadratic charact...

2010
Chin-Yuan Chang Yin-Cheng Hsieh Ting-Yi Wang Yi-Chin Chen Yu-Kuo Wang Ting-Wei Chiang Yi-Ju Chen Cheng-Hsiang Chang Chun-Jung Chen Tung-Kung Wu

CRYSTAL STRUCTURE AND MUTATIONAL ANALYSIS OF AMINOACYLHISTIDINE DIPEPTIDASE FROM VIBRIO ALGINOLYTICUS REVEAL A NEW ARCHITECTURE OF M20 METALLOPEPTIDASES Chin-Yuan Chang, Yin-Cheng Hsieh, Ting-Yi Wang, Yi-Chin Chen, Yu-Kuo Wang, Ting-Wei Chiang , Yi-Ju Chen, Cheng-Hsiang Chang, Chun-Jung Chen*, and Tung-Kung Wu* Department of Biological Science and Technology, National Chiao Tung University, Hsi...

2017
Sandra Plancade S. PLANCADE

This paper presents two results: a density estimator and an estimator of regression error density. We first propose a density estimator constructed by model selection, which is adaptive for the quadratic risk at a given point. Then we apply this result to estimate the error density in an homoscedastic regression framework Yi = b(Xi) + ǫi, from which we observe a sample (Xi, Yi). Given an adapti...

2015
David Lopez-Paz Krikamol Muandet Bernhard Schölkopf Ilya O. Tolstikhin

We pose causal inference as the problem of learning to classify probability distributions. In particular, we assume access to a collection {(Si, li)}i=1, where each Si is a sample drawn from the probability distribution ofXi×Yi, and li is a binary label indicating whether “Xi → Yi” or “Xi ← Yi”. Given these data, we build a causal inference rule in two steps. First, we featurize each Si using t...

1998
Edlyn Teske

In Pollard's rho method, an iterating function f is used to de-ne a sequence (yi) by yi+1 = f(yi) for i = 0; 1; 2; : : :, with some starting value y0. In this paper, we deene and discuss new iterating functions for computing discrete logarithms with the rho method. We compare their performances in experiments with elliptic curve groups. Our experiments show that one of our newly deened function...

2003
Johan Bengtsson Wang Yi

This report is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification. A detailed description on DBM (Difference Bound Matrices) is i...

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

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