KSIĄŻKI POWIĄZANE ZE SŁOWEM «LOGU»
Poznaj użycie słowa
logu w następujących pozycjach bibliograficznych Książki powiązane ze słowem
logu oraz krótkie ich fragmenty w celu przedstawienia kontekstu użycia w literaturze.
1
Algorithm Theory – SWAT 2008: 11th Scandinavian ...
We combine sets Ae into groups G1 ,G2 ,...,G m, such that each group Gi contains Θ(logU) non-empty sets Ae. To be precise, each Gi contains between logU/2 and 2logU sets; for any Ae∈ Gi and any Af∈ Gi+1 , e<f. All elements e, such that ...
Joachim Gudmundsson,
2008
2
Poincaré's Legacies: Pages from Year Two of a ...
To show that the action of U is unipotent, it suffices to verify that ρ(logu) is nilpotent, where (2.209) logu= ( 0 1 0 0 ) is the infinitesimal generator of U. To this end, we will exploit the fact that logu induces a raising operator. We introduce the ...
3
Mathematics And Statistics For Economics, 2E - Halaman 256
Monga G S. yiv) log3 2 (v) 2 (vi) - 1 (v«) 4 (vm) 14 (a) 3 (x) - 1 Ex. 48. Show (0 log10 [286 x /240 x }] = 6 log10 28 + { log10 240 - log,0 3 J~37 x 475 x 5/ 32 (j'O log10- ; ^-^- = 4-log1037 + 51og,047 0.04x^x100 2 10 l0 Ex. 49. Show (i) logu .v1/m ...
4
Advances in Cryptology - EUROCRYPT 2002: International ...
Since these are all random polynomials of degree t, the values (^i.ii l/i,i 'x>,2» J/i.a) are uniformly distributed subject to: Iog9 G = XM + yitl logg h (5) Iog9 di = xl|2 + y,,2 Iog9 h (6) logu e = xiti + axi|2 + (logu v) j/M + (logu v) a yi<2, (7) where (7) ...
5
Scientific and Statistical Database Management: 20th ... - Halaman 55
This is chosen to ensure that when these are summed over logU different summaries, the total error will be bounded by ε/2. INSERT operations take time O(log Ulog logU): we perform 1DINSERT operations for O(logU) nodes in the ...
Bertram Ludäscher, Nikos Mamoulis,
2008
6
Stochastic Portfolio Theory - Halaman 38
... (t) dt 1 77 T2SO(t)) X." (t) dt. Now, a.s., for t € [0, T, X. (log ui(t) + 1)(logu;(t) + 1) ui(t)ij(t)Tij(t) dt =X logu,(t)logu;(t)a(t),(t)T,(t) dt t, j=1 +2 XD logu:(l)u (t)";(t)T,(t) dt *, j=1 + XL us(t)";(t)T,(t) dt t, j=1 =X logu:(t)logu;(t)a(t)\,(t)T,(t) dt, t, j=1 since u(t) is in ...
7
STACS 2001: 18th Annual Symposium on Theoretical ...
Let S be an input set and take n = |S|, u = 1 + maxS, λ = βn2⌈logu⌉ and D = {p ∈ IN | p ≤ λ and the function x→ x mod p ... If logu and therefore λ are polynomial in n, we can pick an integer p uniformly at random from M = {1,...,λ}, apply Rabin's ...
Afonso Ferreira, Horst Reichel,
2001
8
Statistical Tools for Finance and Insurance - Halaman 59
Gumbel copula, where: C(u1 ,u2) = exp[−{(logu 1)θ + (logu 2)θ}1/θ], with A(w) = {wθ + (1 − w)θ}1/θ, (2.21) and θ ∈ [1,∞). 2. Gumbel II copula, where: C(u1 ,u2) = u1 u2 exp{θ(logu 1 logu 2)/(logu 1 + logu 2)}, with A(w) = θw2 − θw + 1, (2.22) ...
Pavel Cizek, Wolfgang Karl Härdle, Rafał Weron,
2005
9
Information Theory for Continuous Systems - Halaman 28
L. IX Let u 6 U. We may assume that (
logu(x))- = — min(
logu(x),0) 6 £'(/j). We define u»(x) = (u(x) V - J An, n=l,2,.... Then #n(x) =
logu»(x) 6 B and / <Pn(x) dfi(z) < log / exp(<?n(x)) du{x) + D0(fi; v). (1.4.20) Jx Jx ...
10
STACS 98: 15th Annual Symposium on Theoretical Aspects ...
0(logn/logu; + log log n). Another possibility is, for a constant c > 0, to implement the upper clog(2 + logn/(logu;)2) levels (if there are that many) according to Theorem 11, at a search cost of O(logu;) per level, and the remaining levels according ...
Michel Morvan, Christoph Meinel, Daniel Krob,
1998