Results 141 to 149 of about 149 (149)
Some of the next articles are maybe not open access.
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, J. +2 more
openaire +4 more sources
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, J. +2 more
openaire +4 more sources
1992
In this chapter we shall develop an important semiclassical method which has come back into favor again, particularly in the last few years, since it permits a continuation into field theory. Here, too, one is interested in nonperturbative methods.
Martin Reuter, Walter Dittrich
openaire +2 more sources
In this chapter we shall develop an important semiclassical method which has come back into favor again, particularly in the last few years, since it permits a continuation into field theory. Here, too, one is interested in nonperturbative methods.
Martin Reuter, Walter Dittrich
openaire +2 more sources
Approximating a Set of Approximate Inclusion Dependencies
2006Approximating a collection of patterns is a new and active area of research in data mining. The main motivation lies in two observations : the number of mined patterns is often too large to be useful for any end-users and user-defined input parameters of many data mining algorithms are most of the time almost arbitrary defined (e.g.
de Marchi, F., Petit, J.M.
openaire +4 more sources
Approximate Memory with Approximate DCT
Proceedings of the 2019 Great Lakes Symposium on VLSI, 2019Approximate Computing is an emerging computing paradigm where one exploits inherent error resilience of certain applications (e.g., digital signal processing, multimedia and artificial intelligence) and trades off absolute computation precisions for performance, power, area, and/or efficiency gains.
Shenghou Ma, Paul Ampadu
openaire +2 more sources
Boussinesq-Approximation (Boussinesq approximation)
2000Es handelt sich um eine mathematische Naherung bei der Beschreibung von Stromungen, die durch Auftriebseffekte hervorgerufen oder beeinflust werden (naturliche bzw. gemischte Konvektion). Dabei wird unterstellt, das die Temperaturabhangigkeit der beteiligten Stoffwerte und hier insbesondere die der Dichte ϱ* bis auf eine einzige Ausnahme vernachlassigt
openaire +2 more sources
APPROXIMATIONS AND APPROXIMATION PROCESSES*
School Science and Mathematics, 1908openaire +2 more sources