3208 search results - page 107 / 642 » A Lower Bound for Primality |
147
click to vote
SPDP
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
147
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
190
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
172
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
201
click to vote
SIAMSC
2010
15 years 4 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...