000077432 001__ 77432
000077432 005__ 20180127193100.0
000077432 0247_ $$2doi$$a10.1006/jcom.2001.0600
000077432 02470 $$2DAR$$a300
000077432 02470 $$2ISI$$a000173453400016
000077432 037__ $$aARTICLE
000077432 245__ $$aAn Algorithm to Compute Bounds for the Star Discrepancy
000077432 269__ $$a2001
000077432 260__ $$c2001
000077432 336__ $$aJournal Articles
000077432 500__ $$aPRO 2001.16
000077432 520__ $$aWe propose an algorithm to compute upper and lower bounds  for the star discrepancy of an arbitrary sequence of points  in the s-dimensional unit cube. The method is based on a  particular partition of the unit cube into subintervals and  on a specialized procedure for orthogonal range counting.  The cardinality of the partition depends on the dimension  and on an accuracy parameter that has to be specified. We  have implemented this method and here we present results of  some computational experiments obtained with this  implementation.
000077432 700__ $$aThiémard, Eric
000077432 773__ $$j17$$k4$$q850-880$$tJournal of Complexity
000077432 8564_ $$uhttp://dx.doi.org/10.1006/jcom.2001.0600$$zURL
000077432 909C0 $$0252055$$pROSO
000077432 909CO $$ooai:infoscience.tind.io:77432$$particle
000077432 937__ $$aROSO-ARTICLE-2001-008
000077432 970__ $$aThiemard2001_23/ROSO
000077432 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000077432 980__ $$aARTICLE