1369 search results - page 121 / 274 » Lattice computations for random numbers |
JCT
2007
13 years 9 months ago
2007
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 → ∞,...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
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 ...
133
click to vote
Book
C code implementation of several math algorithms such as Linear Algebraic Equations,
Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
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...
ICCAD
2005
IEEE
14 years 6 months ago
2005
IEEE
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 ...