Computing Complexity of A New Type of the Diaphony

Dimitrievska Ristovska, Vesna and Grozdanov, Vassil and Stoilova, Stanislava and Kusakatov, Vancho (2012) Computing Complexity of A New Type of the Diaphony. In: Proceedings of the Nineth Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 206-208. ISBN 978-608-4699-01-9

[img]
Preview
Text
978-608-4699-01-9_pp206-208.pdf

Download (197kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

n 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 O ( N ) of the ( W ( b ); γ ) -- diaphony of an arbitrary net, composed of N points in [0,1) s is obtained.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Theoretical Foundations of Informatics
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11321

Actions (login required)

View Item View Item