An Algorithm to Compute Bounds for the Star Discrepancy
Related publications (27)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the demand of their parts or components over a planning hor ...
We present a method that is able to track several 3D objects si- multaneously, robustly, and accurately in real-time. While many applications need to consider more than one object in practice, the existing methods for single object tracking do not scale we ...
During the last decade the field of computational chem. has experienced an enormous progress. Due to the exponential increase in computer power and the development of new computational methods it has now become possible to treat many complex chem. and biol ...
2003
Given n points in the s-dimensional unit cube, we consider the problem of finding a subinterval of minimum or maximum volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to tackle their ...
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...
Institute of Electrical and Electronics Engineers2005
We study sequences of metrics on a compact surface with bounded area and curvature and I prove that if the conformalstructure of these metrics remains bounded, then either the sequence contains a convergent subsequence, or there exists a point at which a c ...
We observe that the time required to compute the star discrepancy of a sequence of points in a multidimensional unit cube is prohibitive and that the best known upper bounds for the star discrepancy of (t,s)-sequences and (t,m,s)-nets are useful only for s ...
