Results 31 to 40 of about 5,109,809 (289)
Lower bounds for incidences with hypersurfaces
Discrete Analysis, 2016 Lower bounds for incidences with hypersurfaces, Discrete Analysis 2016:16, 14pp. A fundamental result in combinatorial geometry, the Szemerédi-Trotter theorem, states that among any $n$ points and $m$ lines in $\mathbb R^2$ there can be at most $O((mn)^{
Adam Sheffer
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
A lower bound on opaque sets [PDF]
Computational Geometry, 2019 13 pages, 10 ...
Akitoshi Kawamura +3 more
openaire +7 more sources
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
Setting lower bounds on truthfulness [PDF]
Games and Economic Behavior, 2018 We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of $2-\frac{1}{m}$ for the ...
Ahuva Mu'alem, Michael Schapira
openaire +2 more sources
Exponential lower bounds and separation for query rewriting [PDF]
, 2012 We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies.
S. Kikot +11 more
core +1 more source
Input Redundancy for Parameterized Quantum Circuits
Frontiers in Physics, 2020 One proposal to utilize near-term quantum computers for machine learning are Parameterized Quantum Circuits (PQCs). There, input is encoded in a quantum state, parameter-dependent unitary evolution is applied, and ultimately an observable is measured. In
Francisco Javier Gil Vidal +2 more
doaj +1 more source
Cramer–Rao lower bounds for change points in additive and multiplicative noise [PDF]
, 2004 The paper addresses the problem of determining the Cramer–Rao lower bounds (CRLBs) for noise and change-point parameters, for steplike signals corrupted by multiplicative and/or additive white noise. Closed-form expressions for the signal and noise CRLBs
Ferrari, André +2 more
core +1 more source
A compact model for the home healthcare routing and scheduling problem
EURO Journal on Computational OptimizationHome healthcare has become more and more central in the last decades, due to the advantages it can bring to both healthcare institutions and patients. Planning activities in this context, however, presents significant challenges related to route planning
Roberto Montemanni +2 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