Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
C code implementation of several math algorithms such as Linear Algebraic Equations,
Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
William H. Press, Saul A. Teukolsky, William T. Ve...
We propose a new loss function for discriminative learning of Markov random fields, which is an intermediate loss function between the sequential loss and the pointwise loss. We s...
In this paper we describe several novel sparsification techniques used in a Fast Stochastic Integral Equation Solver to compute the mean value and the variance of capacitance of ...