Results 231 to 240 of about 430,873 (249)
Optimizing crop clustering to minimize pathogen invasion in agriculture. [PDF]
Sci RepSuprunenko YF, Gilligan CA.
europepmc +1 more source
Compact and Interpretable Neural Networks Using Lehmer Activation Units. [PDF]
Entropy (Basel)Ataei M, Forouzi S, Wang X.
europepmc +1 more source
Instanton-like effect caused by qubit-boson interaction in light of quantum simulation. [PDF]
Sci RepHirokawa M.
europepmc +1 more source
The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]
Theory Comput Systvan Heuven van Staereling I +2 more
europepmc +1 more source
Continuum approximation of dislocation correlations for systems of curved dislocations. [PDF]
J Mater Sci Mater TheoryMarx AJ, Sandfeld S, Hochrainer T.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n ...
Giesen, Joachim +2 more
openaire +1 more source
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n ...
Giesen, Joachim +2 more
openaire +1 more source
Approximating Approximate Fibrations by Fibrations
Canadian Journal of Mathematics, 1977A map p: E → B between metric spaces has the approximate homotopy lifting property with respect to the space X if given a cover Ū of B and maps g: X → E and H: X × [0, 1] → B such that H(x, 0) = pg(x) for all x ϵ X, then there exists a map G: X × [0, 1] → E such that G(x, 0) = g(x) and pGt and Ht are Ū-close for all x ϵ X and t ϵ [0, 1]; i.e. given (x,
openaire +1 more source
2015
In this chapter the problem of viscous friction is considered when the medium is described by a gas of free particles in the mean field approximation.We give necessary conditions on the body/medium interaction to have a microscopic model of viscous friction and, conversely, we show that the runaway particle effect takes place in the case of bounded ...
Buttà, Paolo +2 more
openaire +2 more sources
In this chapter the problem of viscous friction is considered when the medium is described by a gas of free particles in the mean field approximation.We give necessary conditions on the body/medium interaction to have a microscopic model of viscous friction and, conversely, we show that the runaway particle effect takes place in the case of bounded ...
Buttà, Paolo +2 more
openaire +2 more sources
2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source