low discrepancy sequences
Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
... guarantees for the covering radius, we verified experimentally, over a larger set of case studies than those presented in the paper, that the design sequences obtained by its greedy maximization have smaller CR ...
29
Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
... guarantees for the covering radius, we verified experimentally, over a larger set of case studies than those presented in the paper, that the design sequences obtained by its greedy maximization have smaller CR ...
29
Sample dispersion is better than sample discrepancy for classification
... with low discrepancy sequence than with a regular grid (which have a higher ...Therefore discrepancy does not seem to be the relevant criterion to get optimal samples for ...using low ...
22
Van der Corput sequences towards general (0,1)–sequences in base b
... unidimensional low discrepancy sequences, we can assert that the original van der Corput sequences are the worst distributed with respect to var- ious measures of irregularities of ...
17
Substitution invariant cutting sequences
... Since reflection in y = ~ interchanges the (3x and y = and also the horizontal and vertical lines of the grid, it can be seen that If 0 # 1 then 1/p > 1 and it follows that we can, if desired, use R to deduce ...
16
On completely multiplicative automatic sequences
... In recent papers, we found some results in the literature on similar topics, which have applica- tions to the classification of CMAS. In [LM18], the authors prove that all continuous observables in a substitutional ...
11
Regularization of inverse problems with adaptive discrepancy terms: application to multispectral data
... • the adaptive thresholding (Fig. 3, middle right and bottom left panels) seen in subsection 3.2.2. This is obtained with the adaptive algorithm (Algo. 3.2) Note that there is no stability issue in this example. One can ...
16
On the discrepancy of Markov-normal sequences
... in [12] one can reduce the logarithmic multiplier in (32) to 0(log N3/2). To reduce the logarithmic multiplier forther see [15]. Problem. According to [12-14] the Borel and Bernoulli normal numbers ex- ist with ...
17
Digital nets in dimension two with the optimal order of $L_p$ discrepancy
... p discrepancy of two-dimensional digital nets for finite ...L2 discrepancy of the order √ log N /N , which is best possible due to the celebrated result of ...this discrepancy bound also holds for ...
27
Complexity of Hartman sequences
... Hartman sequences Corresponding to the fact that ergodic group translations have entropy 0, one conjectures that the complexity of a Hartman sequence is subexpo- ...
12
Performance analysis of greedy algorithms for minimising a Maximum Mean Discrepancy
... Mean Discrepancy; quantisation; greedy algorithm; sequential Bayesian quadra- ture; kernel herding; space-filling design; computer experiments 1 Introduction and motivation ...Mean Discrepancy (MMD) defined ...
35
A Discrepancy-Based Framework to Compare Robustness Between Multi-attribute Evaluations
... Fig. 2. Sensitivity of robustness to missing data. Left. For each department, Monte Carlo simulations (N=50 repetitions) are used to determine the impact of miss- ing data on robustness of segregation evaluation. ...
15
Some results around automatic sequences
... multiplicative sequences, which will be referred to as CMS, taking values in a general eld that have nitely many prime numbers such that a p 6= 1 ; she proves that such CMS have ...
89
Iterative decoding of Gold sequences
... Gold sequences form a family of binary sequences with excellent correlation properties ...theses sequences, an iterative message-passing algorithm can be implemented to decode the received signal ...
7
Dyadic diaphony of digital sequences
... Remark. Together with Corollary 2.2 we also obtain a central limit theo- rem for the square of the classical diaphony of NUT-sequences. Proof. As already mentioned, the proof follows exactly the lines of the proof ...
22
Logarithmic frequency in morphic sequences
... [5] S. Nicolay, M. Rigo, About frequencies of letters in generalized automatic sequences. The- oret. Comput. Sci. 374 (2007), no. 1-3, 25–40. [6] K. Saari, On the frequency of letters in morphic sequences. ...
16
Constructing Incremental Sequences in Graphs
... Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des Vi[r] ...
16
Balanced Sequences and Optimal Routing
... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ...
26
A limited discrepancy search method for solving disjunctive scheduling problems with resource flexibility
... A limited discrepancy search method for solving disjunctive scheduling problems with resource flexibility Marie-José Huguet, Pierre Lopez, Abir Ben Hmida.. To cite this version: Marie-Jo[r] ...
5
Bumping sequences and multispecies juggling
... Other models with a fluctuating number of balls of each type (but with a finite state space) are considered in Section 3: we introduce the multispecies extension of the add-drop and the [r] ...
26