Results 21 to 30 of about 1,003,788 (328)
Lower bounds in differential privacy [PDF]
This is a paper about private data analysis, in which a trusted curator holding a confidential database responds to real vector-valued queries. A common approach to ensuring privacy for the database elements is to add appropriately generated random noise
C. Dwork +3 more
core +2 more sources
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
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
Model Checking Lower Bounds for Simple Graphs [PDF]
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
On lower bounds for the Kirchhoff index [PDF]
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
Energy of Nonsingular Graphs: Improving Lower Bounds
Let G be a simple graph of order n and A be its adjacency matrix. Let λ1≥λ2≥…≥λn be eigenvalues of matrix A. Then, the energy of a graph G is defined as εG=∑i=1nλi.
Hajar Shooshtari +3 more
doaj +1 more source
Effective Lower Bound Risk [PDF]
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
Lower Bounds for Monotone Counting Circuits [PDF]
A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values.
Jukna, Stasys
core +1 more source
Lower Complexity Bounds for Lifted Inference [PDF]
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
Lower bounds for adaptive linearity tests [PDF]
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
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source

