Results 1 to 10 of about 414,399 (218)
Upper Tail Bounds for Stars [PDF]
The Electronic Journal of Combinatorics, 2020 For $r \ge 2$, let $X$ be the number of $r$-armed stars $K_{1,r}$ in the binomial random graph $G_{n,p}$. We study the upper tail ${\mathbb P}(X \ge (1+\epsilon){\mathbb E} X)$, and establish exponential bounds which are best possible up to constant factors in the exponent (for the special case of stars $K_{1,r}$ this solves a problem of Janson and ...
Šileikis, M. (Matas), Warnke, L.
openaire +4 more sources
Upper Bound Approximation for BlockMaxWand [PDF]
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017 BlockMaxWand is a recent advance on the Wand dynamic pruning technique, which allows efficient retrieval without any e.ectiveness degradation to rank K. However, while BMW uses docid-sorted indices, it relies on recording the upper bound of the term weighting model scores for each block of postings in the inverted index.
MacDonald C., Tonellotto N.
openaire +2 more sources
Thrackles: An Improved Upper Bound [PDF]
Discrete Applied Mathematics, 2018 Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)
Radoslav Fulek, János Pach
openaire +6 more sources
Classical Lower Bounds from Quantum Upper Bounds [PDF]
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018 46 pages; to appear at FOCS ...
Ben-David, Shalev +3 more
openaire +2 more sources
Physical Review Letters, 2017 The linear growth of operators in local quantum systems leads to an effective light cone even if the system is nonrelativistic. We show that the consistency of diffusive transport with this light cone places an upper bound on the diffusivity: D≲v^{2}τ_{eq}.
Thomas, Hartman +2 more
openaire +3 more sources
Lower Bounds and Upper Bounds for MaxSAT [PDF]
, 2012 This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Heras, Federico +2 more
openaire +2 more sources
Upper bounds of Schubert polynomials [PDF]
Science China Mathematics, 2021 14 pages, 4 ...
Fan, Neil Jiuyu, Guo, Peter Long
openaire +3 more sources
Upper bounds on focusing efficiency
Optics Express, 2022 Upper bounds on the focusing efficiency of aperture fields and lens systems are formulated using integral equation representations of Maxwell’s equations and Lagrangian duality. Two forms of focusing efficiency are considered based on lens exit plane fields and optimal polarization currents within lens design regions of prescribed shape and available ...
Kurt Schab +3 more
openaire +2 more sources
Upper Bounds for Cyclotomic Numbers [PDF]
Algebraic Combinatorics, 2020 Let q be a power of a prime p, let k be a nontrivial divisor of q-1 and write e=(q-1)/k. We study upper bounds for cyclotomic numbers (a,b) of order e over the finite field 𝔽 q . A general result of our study is that (a,b)≤3 for all a,b∈ℤ if p>(14) k/ord k (p) .
Duc, Tai Do +2 more
openaire +5 more sources
ON POLYTOPAL UPPER BOUND SPHERES [PDF]
Mathematika, 2013 Generalizing a result (the case $k = 1$) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension $2k + 1$ belongs to the generalized Walkup class ${\cal K}_k(2k + 1)$, i.e., all its vertex links are $k$-stacked spheres. This is surprising since the $k$-stacked spheres minimize the face-vector (among all polytopal spheres ...
Bagchi, Bhaskar, Datta, Basudeb
openaire +4 more sources