Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20068| Title: | COMPUTING COMPLEXITY OF A NEW TYPE OF THE DIAPHONY | Authors: | Dimitrievska Ristovska, Vesna Stoilova, Stanislava Grozdanov, Vassil Kusakatov, Vancho |
Issue Date: | 2012 | Conference: | CIIT 2012 | Abstract: | In the present paper we introduce a new version of the diaphony, the so-called weighted ( ( ); ) W b γ - diaphony. It is shown that the ( ( ); ) W b γ - diaphony is a numerical measure for uniform distribution of sequences in [0,1)s . The computing complexity ( ) 2 O N of the ( ( ); ) W b γ - diaphony of an arbitrary net, composed of N points in [0,1)s is obtained. | URI: | http://hdl.handle.net/20.500.12188/20068 |
| Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 9CiiT-42.pdf | 193.26 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.