2312 search results - page 153 / 463 » The complexity of estimating min-entropy |
162
click to vote
ISSAC
2005
Springer
16 years 10 hour ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
131
click to vote
ANSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The results presented here are based on many years of experience of development and application of DYANA
236
click to vote
IAJIT
2011
15 years 1 months ago
2011
: User interfaces have special characteristics that differentiate them from the rest of the software code. Typical software metrics that indicate its complexity and quality may not...
193
click to vote
JMLR
2011
15 years 1 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
178
click to vote
WIA
2009
Springer
16 years 1 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...