Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Bhattacharjee, Kamalika"'
Autor:
J., Baby C., Bhattacharjee, Kamalika
This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they are closely
Externí odkaz:
http://arxiv.org/abs/2408.02250
In this paper, a decimal first degree cellular automata (FDCA) based clustering algorithm is proposed where clusters are created based on reachability. Cyclic spaces are created and configurations which are in the same cycle are treated as the same c
Externí odkaz:
http://arxiv.org/abs/2405.04881
This work introduces a new problem, named as, affinity classification problem which is a generalization of the density classification problem. To solve this problem, we introduce temporally stochastic cellular automata where two rules are stochastica
Externí odkaz:
http://arxiv.org/abs/2207.05446
Autor:
Bhattacharjee, Kamalika
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical tool, name
Externí odkaz:
http://arxiv.org/abs/1911.03609
Autor:
Bhattacharjee, Kamalika, Das, Sukanta
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the rule only,
Externí odkaz:
http://arxiv.org/abs/1903.06011
Publikováno v:
Computer Science Review Volume 45, August 2022, 100471
In today's world, several applications demand numbers which appear random but are generated by a background algorithm; that is, pseudo-random numbers. Since late $19^{th}$ century, researchers have been working on pseudo-random number generators (PRN
Externí odkaz:
http://arxiv.org/abs/1811.04035
Autor:
Bhattacharjee, Kamalika, Das, Sukanta
Publikováno v:
In Computer Science Review August 2022 45
Publikováno v:
Natural Computing, Volume 19, 2020
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several resea
Externí odkaz:
http://arxiv.org/abs/1607.02291
Autor:
Bhattacharjee, Kamalika, Das, Sukanta
Publikováno v:
Kamalika Bhattacharjee and Sukanta Das. Reversibility of d-state finite cellular automata. Journal of Cellular Automata, 11(2-3):213-245, 2016
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph which repres
Externí odkaz:
http://arxiv.org/abs/1502.01187
Autor:
BHATTACHARJEE, KAMALIKA1 kamalika.it@gmail.com, VIKRANT, VICKY1 vicky.vikrant8396@gmail.com
Publikováno v:
Journal of Cellular Automata. 2023, Vol. 17 Issue 1/2, p47-78. 32p.