نتایج جستجو برای: variable sampling schemes

تعداد نتایج: 554660  

Journal: :Theoretical population biology 2011
Matthias Birkner Jochen Blath Matthias Steinrücken

We present and discuss new importance sampling schemes for the approximate computation of the sample probability of observed genetic types in the infinitely many sites model from population genetics. More specifically, we extend the 'classical framework', where genealogies are assumed to be governed by Kingman's coalescent, to the more general class of Lambda-coalescents and develop further Hob...

1998
Fu-Hua Liu Michael Picheny

In this paper we describe a novel approach to address the issue of different sampling frequencies in speech recognition. In general, when a recognition task needs a different sampling frequency from that of the reference system, it is customary to retrain the system for the new sampling rate. To circumvent the tedious training process, we propose a new approach termed Sampling Rate Transformati...

2013
Nicolas Chauffert Philippe Ciuciu Jonas Kahn Pierre Weiss

Compressed sensing theory indicates that selecting a few measurements independently at random is a near optimal strategy to sense sparse or compressible signals. This is infeasible in practice for many acquisition devices that acquire samples along continuous trajectories. Examples include magnetic resonance imaging (MRI), radio-interferometry, mobile-robot sampling, ... In this paper, we propo...

2016
MITSUO IZUKI

hold. The facts above are well-known as the classical Shannon sampling theorem initially proved by Ogura [10]. Ashino and Mandai [1] generalized the sampling theorem in Lebesgue spaces L0(R) for 1 < p0 < ∞. Their generalized sampling theorem is the following. Theorem 1.1 ([1]). Let r > 0 and 1 < p0 < ∞. Then for all f ∈ L 0(R) with supp f̂ ⊂ [−rπ, rπ], we have the norm inequality C p r ‖f‖Lp0(Rn...

Journal: :Terrestrial, Atmospheric and Oceanic Sciences 1993

1997
Andreas Schirmer

Most combinatorial scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Of these, priority rule-based methods despite their age still constitute the most important class of which. in turn, parameterized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rulebased m...

2008
Qishen Huang Norman L. Johnson Samuel Kotz

Norman L. Johnson University of North Carolina at Chapel Hill Samuel Kotz University of Maryland College Park Continuing previous work on effects of errors in inspection on group sampling schemes, a modification of Dorfman-Sterrett schemes is studied. The modification consists of reversion to group sampling when a specified number of decisions of nonconformance have occurred in the course of in...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید