Results 1  10
of
766
Strictly Proper Scoring Rules, Prediction, and Estimation
, 2007
"... Scoring rules assess the quality of probabilistic forecasts, by assigning a numerical score based on the predictive distribution and on the event or value that materializes. A scoring rule is proper if the forecaster maximizes the expected score for an observation drawn from the distribution F if he ..."
Abstract

Cited by 373 (28 self)
 Add to MetaCart
measures, entropy functions, and Bregman divergences. In the case of categorical variables, we prove a rigorous version of the Savage representation. Examples of scoring rules for probabilistic forecasts in the form of predictive densities include the logarithmic, spherical, pseudospherical, and quadratic
The antik t jet clustering algorithm
 JHEP 04 (2008) 063, arXiv:0802.1189 [hepph
"... Abstract: The kt and Cambridge/Aachen inclusive jet finding algorithms for hadronhadron collisions can be seen as belonging to a broader class of sequential recombination jet algorithms, parametrised by the power of the energy scale in the distance measure. We examine some properties of a new membe ..."
Abstract

Cited by 280 (5 self)
 Add to MetaCart
member of this class, for which the power is negative. This “antikt ” algorithm essentially behaves like an idealised cone algorithm, in that jets with only soft fragmentation are conical, active and passive areas are equal, the area anomalous dimensions are zero, the nonglobal logarithms are those
Negative Exponential versus Logarithmic Poisson
, 2014
"... Mathematical models for the estimation of number, locality and severity of defects in a system. Considerations of the impact on human safety. Concepts: ..."
Abstract
 Add to MetaCart
Mathematical models for the estimation of number, locality and severity of defects in a system. Considerations of the impact on human safety. Concepts:
Computing Elliptic Curve Discrete Logarithms with the Negation Map
, 2011
"... It is clear that the negation map can be used to speed up the computation of elliptic curve discrete logarithms with the Pollard rho method. However, the random walks defined on elliptic curve points equivalence class {±P} used by Pollard rho will always get trapped in fruitless cycles. We propose ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It is clear that the negation map can be used to speed up the computation of elliptic curve discrete logarithms with the Pollard rho method. However, the random walks defined on elliptic curve points equivalence class {±P} used by Pollard rho will always get trapped in fruitless cycles. We
Classification and Powerlaws: The logarithmic transformation
 Journal of the American Society for Information Science and Technology
, 2006
"... (forthcoming) Logarithmic transformation of the data has been recommended by the literature in the case of highly skewed distributions such as those commonly found in information science. The purpose of the transformation is to make the data conform to the lognormal law of error for inferential purp ..."
Abstract

Cited by 18 (11 self)
 Add to MetaCart
and therefore is counterproductive to the purposes of the descriptive statistics. We recommend against the logarithmic transformation when sets cannot be defined unambiguously. The intellectual organization of the sciences is reflected in the curvilinear parts of the citation distributions, while negative
Massively parallel computation of discrete logarithms
, 1993
"... Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We dis ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We
An explicit formula for the matrix logarithm
, 2008
"... We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment {I(1 − t) + At: t ∈ [0,1]} joining the identity matrix I (at t = 0) to any real matrix A (at t = 1) having no eigenvalues on the closed negative real axis. This extends to the m ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment {I(1 − t) + At: t ∈ [0,1]} joining the identity matrix I (at t = 0) to any real matrix A (at t = 1) having no eigenvalues on the closed negative real axis. This extends
LOGARITHMIC TRACE AND ORBIFOLD PRODUCTS
, 2009
"... The purpose of this paper is to give a purely equivariant definition of orbifold Chow rings of quotient DeligneMumford stacks. This completes a program begun in [JKK] for quotients by finite groups. The key to our construction is the definition (Section 6.1), of a twisted pullback in equivariant ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Ktheory, KG(X) → KG(I2 G (X)) taking nonnegative elements to nonnegative elements. (Here I2 G (X) = {(g1, g2, x)g1x = g2x = x} ⊂ G × G × X.) The twisted pullback is defined using data about fixed loci of elements of finite order in G, but depends only on the underlying quotient stack (Theorem
From BrunnMinkowski To BrascampLieb And To Logarithmic Sobolev Inequalities
 Geom. Funct. Anal
"... .  We develop several applications of the BrunnMinkowki inequality in the Pr'ekopaLeindler form. In particular, we show that an argument of B. Maurey may be adapted to deduce from the Pr'ekopaLeindler inequality the BrascampLieb inequality for stricly convex potentials. We deduce sim ..."
Abstract

Cited by 74 (2 self)
 Add to MetaCart
similarly the logarithmic Sobolev inequality for uniformly convex potentials for which we deal more generally with arbitrary norms and obtain some new results in this context. Applications to transportation cost and to concentration on uniformly convex bodies complete the exposition. 1. Introduction The Pr
On fusion rules in logarithmic conformal field theories
 Int. J. Mod. Phys
, 1997
"... We find the fusion rules for the cp,1 series of logarithmic conformal field theories. This completes our attempts to generalize the concept of rationality for conformal field theories to the logarithmic case. A novelty is the appearance of negative fusion coefficients which can be understood in term ..."
Abstract

Cited by 43 (12 self)
 Add to MetaCart
We find the fusion rules for the cp,1 series of logarithmic conformal field theories. This completes our attempts to generalize the concept of rationality for conformal field theories to the logarithmic case. A novelty is the appearance of negative fusion coefficients which can be understood
Results 1  10
of
766