Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20068| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Dimitrievska Ristovska, Vesna | en_US |
| dc.contributor.author | Stoilova, Stanislava | en_US |
| dc.contributor.author | Grozdanov, Vassil | en_US |
| dc.contributor.author | Kusakatov, Vancho | en_US |
| dc.date.accessioned | 2022-06-30T09:40:24Z | - |
| dc.date.available | 2022-06-30T09:40:24Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/20068 | - |
| dc.description.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. | en_US |
| dc.title | COMPUTING COMPLEXITY OF A NEW TYPE OF THE DIAPHONY | en_US |
| dc.type | Proceeding article | en_US |
| dc.relation.conference | CIIT 2012 | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| 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.