Results 11 to 20 of about 713,380 (292)

Hypothesis testing for arbitrary bounds [PDF]

open access: yesEconomics Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penney, Jeffrey, Penney, Jeffrey
openaire   +5 more sources

Testing bounded arboricity [PDF]

open access: yesACM Transactions on Algorithms, 2018
In this article, we consider the problem of testing whether a graph has bounded arboricity. The class of graphs with bounded arboricity includes many important graph families (e.g., planar graphs and randomly generated preferential attachment graphs).
Talya Eden, Reut Levi, Dana Ron
openaire   +4 more sources

Parameterizations of Test Cover with Bounded Test Sizes [PDF]

open access: yesAlgorithmica, 2014
In the {\sc Test Cover} problem we are given a hypergraph $H=(V, \mathcal{E})$ with $|V|=n, |\mathcal{E}|=m$, and we assume that $\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \in \mathcal{E}$ such that $|{x_i,x_j}\cap e|=1$.
Crowston, R.   +4 more
openaire   +3 more sources

Bounds, Breaks and Unit Root Tests [PDF]

open access: yesJournal of Time Series Analysis, 2015
The paper addresses the unit root testing when the range of the time series is limited and considering the presence of multiple structural breaks. The structural breaks can affect the level and/or the boundaries of the time series. The paper proposes five unit root test statistics, whose limiting distribution is shown to depend on the number and ...
Carrión i Silvestre, Josep Lluís   +1 more
openaire   +3 more sources

Testing Expansion in Bounded-Degree Graphs [PDF]

open access: yesCombinatorics, Probability and Computing, 2007
We consider the problem oftesting expansion in bounded-degree graphs. We focus on the notion ofvertex expansion: an α-expander is a graphG= (V,E) in which every subsetU⊆Vof at most |V|/2 vertices has a neighbourhood of size at least α ⋅ |U|. Our main result is that one can distinguish good expanders from graphs that are far from being weak expanders in
Czumaj, Artur, Sohler, Christian
openaire   +2 more sources

SHARPER BOUNDS IN ADAPTIVE GROUP TESTING [PDF]

open access: yesTaiwanese Journal of Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Riccio, Laura, Colbourn, Charles J.
openaire   +3 more sources

The asymmetric and threshold impact of external debt on economic growth: new evidence from Egypt [PDF]

open access: yesJournal of Business and Socio-Economic Development, 2022
Purpose – Within a multivariate framework, this study examines the asymmetric and threshold impact of external debt on economic growth in Egypt during the period 1980–2019.
Mesbah Fathy Sharaf
doaj   +1 more source

Independent nonclassical tests for states and measurements in the same experiment [PDF]

open access: yes, 2011
We show that one single experiment can test simultaneously and independently both the nonclassicality of states and measurements by the violation or fulfillment of classical bounds on the statistics. Nonideal measurements affected by imperfections can be
Alfredo Luis   +10 more
core   +3 more sources

Group Testing Algorithms: Bounds and Simulations [PDF]

open access: yesIEEE Transactions on Information Theory, 2014
We consider the problem of non-adaptive noiseless group testing of $N$ items of which $K$ are defective. We describe four detection algorithms: the COMP algorithm of Chan et al.; two new algorithms, DD and SCOMP, which require stronger evidence to declare an item defective; and an essentially optimal but computationally difficult algorithm called SSS ...
Aldridge, M, Baldassini, L, Johnson, O
openaire   +4 more sources

Validation of Voting Committees [PDF]

open access: yes, 1997
This article contains a method to bound the test errors of voting committees with members chosen from a pool of trained classifiers. There are so many prospective committees that validating them directly does not achieve useful error bounds.
Bax, Eric
core   +4 more sources

Home - About - Disclaimer - Privacy