Results 1  10
of
22,140
Curvelets: a surprisingly effective nonadaptive representation of objects with edges
 IN CURVE AND SURFACE FITTING: SAINTMALO
, 2000
"... It is widely believed that to efficiently represent an otherwise smooth object with discontinuities along edges, one must use an adaptive representation that in some sense ‘tracks ’ the shape of the discontinuity set. This folkbelief — some would say folktheorem — is incorrect. At the very least ..."
Abstract

Cited by 388 (21 self)
 Add to MetaCart
It is widely believed that to efficiently represent an otherwise smooth object with discontinuities along edges, one must use an adaptive representation that in some sense ‘tracks ’ the shape of the discontinuity set. This folkbelief — some would say folktheorem — is incorrect. At the very
The Turn Model for Adaptive Routing
 JOURNAL OF ACM
, 1994
"... This paper presents a model for designing wormhole routing algorithms, A unique feature of the model is th~t lt is not based cm adding physical or virtual channels to direct networks (although it can be applied to networks with extra channels). Instead, the model is based [In analyzlng the directio ..."
Nonadaptive quantum query complexity
, 2010
"... We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any boundederror nonadaptive quantum query algorithm that computes some total boolean function depending on n variables mu ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
must make Ω(n) queries to the input in total. Second, we show that, if there exists a quantum algorithm that uses k nonadaptive oracle queries to learn which one of a set of m boolean functions it has been given, there exists a nonadaptive classical algorithm using O(k log m) queries to solve the same
Nonadaptive lossy encoding of sparse signals
 Master’s thesis, Massachusetts Inst. of Tech
, 2006
"... At high rate, a sparse signal is optimally encoded through an adaptive strategy that finds and encodes the signal's representation in the sparsityinducing basis. This thesis examines how much the distortion rate (D(R)) performance of a nonadaptive encoder, one that is not allowed to explicitl ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
At high rate, a sparse signal is optimally encoded through an adaptive strategy that finds and encodes the signal's representation in the sparsityinducing basis. This thesis examines how much the distortion rate (D(R)) performance of a nonadaptive encoder, one that is not allowed
Adaptive and nonadaptive group sequential tests
 BIOMETRIKA
"... Methods have been proposed to redesign a clinical trial at an interim stage in order to increase power. In order to preserve the type I error rate, methods for unplanned designchange have to be defined in terms of nonsufficient statistics and this calls into question their efficiency and the cred ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Methods have been proposed to redesign a clinical trial at an interim stage in order to increase power. In order to preserve the type I error rate, methods for unplanned designchange have to be defined in terms of nonsufficient statistics and this calls into question their efficiency and the credibility of conclusions reached. We evaluate schemes for adaptive redesign, extending the theoretical arguments for use of sufficient statistics of Tsiatis & Mehta (2003) and assessing the possible benefits of preplanned adaptive designs by numerical computation of optimal tests; these optimal adaptive designs are concrete examples of optimal sequentiallyplanned sequential tests proposed by Schmitz (1993). We conclude that the flexibility of unplanned adaptive designs comes at a price and we recommend that the appropriate power for a study should be determined as thoroughly as possible at the outset. Then, standard errorspending tests, possibly with unevenlyspaced analyses, provide efficient designs, but it is still possible to fall back on flexible methods for redesign should study objectives change unexpectedly once the trial is under way.
NonAdaptive Combinatorial Group Testing
"... Consider the following problem. We are given eight coins, of which one is known to be fake. We are also allowed the use of a digital scale. Given that the genuine coins weigh 25 grams, and the fake weighs 20 grams, how many weighings does it take to find the fake? The solution is three weighings. We ..."
Abstract
 Add to MetaCart
Consider the following problem. We are given eight coins, of which one is known to be fake. We are also allowed the use of a digital scale. Given that the genuine coins weigh 25 grams, and the fake weighs 20 grams, how many weighings does it take to find the fake? The solution is three weighings
Nonadaptive evolution of genome complexity
 BioEssays 2006
"... Genome complexity is correlated with biological complexity. A recent paper by Michael Lynch proposes that evolution of complex genomic architecture was driven primarily by nonadaptive stochastic forces, rather than by adaptive evolution.(1) A general negative relationship between selection efficie ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Genome complexity is correlated with biological complexity. A recent paper by Michael Lynch proposes that evolution of complex genomic architecture was driven primarily by nonadaptive stochastic forces, rather than by adaptive evolution.(1) A general negative relationship between selection
NONADAPTIVE UNIVARIATE OPTIMIZATION FOR OBSERVATIONS WITH NOISE
"... Abstract. This paper reviews averagecase complexity results for univariate optimization with noisecorrupted function evaluations. The probability model for the objective function is the Wiener process, and the noise is independent Gaussian. Asymptotic bounds are derived for the average error for t ..."
Abstract
 Add to MetaCart
for two nonadaptive algorithms. A lower bound on the convergence rates of nonadaptive algorithms is proved. 1.
Nonadaptability measures with the branching property
"... In this paper we will deal with the measure of nonadaptability between partitions. This concept was especially defined in order to compare partitions in the context of pseudoquestionnaires, even though it can be used in any general context where the comparison of two partitions is required. In ..."
Abstract
 Add to MetaCart
In this paper we will deal with the measure of nonadaptability between partitions. This concept was especially defined in order to compare partitions in the context of pseudoquestionnaires, even though it can be used in any general context where the comparison of two partitions is required
ON NONADAPTIVE SEARCH PROBLEM Emil Kolev
"... Abstract. We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3,..., 2 n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonada ..."
Abstract
 Add to MetaCart
Abstract. We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3,..., 2 n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which
Results 1  10
of
22,140