Results 31 to 40 of about 996,357 (278)
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
IEEE Access, 2019 In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known.
Ian Blanes +3 more
doaj +1 more source
On lower bounds for the Kirchhoff index [PDF]
Kragujevac Journal of Science, 2017 Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kirchhoff index, Kf(G) = n Σ −1 i=
Milovanović I.Ž. 0000-0003-2209-9606 +1 more
doaj +1 more source
Model Checking Lower Bounds for Simple Graphs [PDF]
Logical Methods in Computer Science, 2014 A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent meta-theorems
Michael Lampis
doaj +1 more source
Lower bounds for adaptive linearity tests [PDF]
, 2008 Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear.
Lovett, Shachar
core +5 more sources
Effective Lower Bound Risk [PDF]
Finance and Economics Discussion Series, 2019 Even when the policy rate is currently not constrained by its effective lower bound (ELB), the possibility that the policy rate will become constrained in the future lowers today's inflation by creating tail risk in future inflation and thus reducing expected inflation.
Timothy S. Hills +2 more
openaire +1 more source
Quantum SDP-Solvers: Better upper and lower bounds [PDF]
Quantum, 2020 Brandão and Svore \cite{brandao2016QSDPSpeedup} recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms of the dimension $n$ of the problem ...
Joran van Apeldoorn +3 more
doaj +1 more source
Lower Complexity Bounds for Lifted Inference [PDF]
, 2012 One of the big challenges in the development of probabilistic relational (or probabilistic logical) modeling and learning frameworks is the design of inference techniques that operate on the level of the abstract model representation language, rather ...
Apsel +21 more
core +1 more source
The global rate of convergence for optimal tensor methods in smooth convex optimization [PDF]
Компьютерные исследования и моделирование, 2018 In this work we consider Monteiro - Svaiter accelerated hybrid proximal extragradient (A-HPE) framework and accelerated Newton proximal extragradient (A-NPE) framework.
Alexander Vladimirovich Gasnikov +4 more
doaj +1 more source
Distribution-sensitive set multi-partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence of the members of $\mathcal{S}$ such that if $x,y \in \mathcal{S}$ have different types and $x <
Amr Elmasry
doaj +1 more source
Algorithms, 2020 This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra +2 more
doaj +1 more source