On existence and discrepancy of certain digital Niederreiter-Halton sequences
Roswitha Hofer, Gerhard Larcher (2010)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Optimal 𝓛₂ discrepancy bounds for higher order digital sequences over the finite field 𝔽₂”
On existence and discrepancy of certain digital Niederreiter-Halton sequences
Improved upper bounds for the star discrepancy of digital nets in dimension 3
Friedrich Pillichshammer (2003)
Acta Arithmetica
Similarity:
A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy
Henri Faure, Friedrich Pillichshammer (2013)
Acta Arithmetica
Similarity:
In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize...
Constructions of digital nets
Harald Niederreiter, Chaoping Xing (2002)
Acta Arithmetica
Similarity:
Sums of distances to the nearest integer and the discrepancy of digital nets
G. Larcher, F. Pillichshammer (2003)
Acta Arithmetica
Similarity:
Discrepancy and diaphony of digital (0,1)-sequences in prime base
Henri Faure (2005)
Acta Arithmetica
Similarity:
Improved discrepancy bounds for hybrid sequences involving Halton sequences
(2012)
Acta Arithmetica
Similarity:
Anacom Project
N. Sigaud (2002)
Visual Mathematics
Similarity:
On the evaluation of functions on digital computers
Z. Cylkowski (1966)
Applicationes Mathematicae
Similarity:
Notes on the evolution of feature selection methodology
Petr Somol, Jana Novovičová, Pavel Pudil (2007)
Kybernetika
Similarity:
The paper gives an overview of feature selection techniques in statistical pattern recognition with particular emphasis on methods developed within the Institute of Information Theory and Automation research team throughout recent years. Besides discussing the advances in methodology since times of Perez’s pioneering work the paper attempts to put the methods into a taxonomical framework. The methods discussed include the latest variants of the optimal algorithms, enhanced sub-optimal...
Table of Contents
Similarity:
A new construction of (t,s)-sequences and some improved bounds on their quality parameter
David J. S. Mayor, Harald Niederreiter (2007)
Acta Arithmetica
Similarity:
An existence result on partitioning of a measurable space: Pareto optimality and core
Nobusumi Sagara (2006)
Kybernetika
Similarity:
This paper investigates the problem of optimal partitioning of a measurable space among a finite number of individuals. We demonstrate the sufficient conditions for the existence of weakly Pareto optimal partitions and for the equivalence between weak Pareto optimality and Pareto optimality. We demonstrate that every weakly Pareto optimal partition is a solution to the problem of maximizing a weighted sum of individual utilities. We also provide sufficient conditions for the existence...