نتایج جستجو برای: linear cellular automata

تعداد نتایج: 926238  

Journal: :Journal of Computer and System Sciences 1992

Journal: :ecopersia 0
alireza ildoromi associate professor, department of range and watershed management, malayer university, malayer, iran mahtab safari shad ph.d. student, department watershed management, faculty of natural resources, sari university of agriculture and natural resource, sari, iran

landsat data for 1992, 2000, and 2013 land use changes for ekbatan dam watershed was simulated through ca-markov” model. two classification methods were initially used, viz. the maximum likelihood (mal) and support vector machine (svm). although both methods showed high overall accuracy and kappa coefficient, visually mal failed in separating land uses, particularly built up and dry lands.there...

Rahil hosseini

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

Journal: :Journal of Computer and System Sciences 1994

Rahil hosseini

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

ژورنال: محاسبات نرم 2014

In this paper, a new structure for image encryption using hybrid cellular automata is presented. The image encryption is done in two steps. At the first step, each pixel is encrypted by rules of hybrid cellular automata. In the next step, each pixel converted to a binary number and each bit is encrypted by rules of cellular automata. The rules are made by a function. Due to reversibility of cel...

1990
Harold V. McIntosh

6 The calculus of regular expressions 75 6.1 Derivatives

1997
Cristopher Moore

Simulating a cellular automaton (CA) for t time-steps into the future requires t serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed linear because they obey a principle of superposition. This allows them to be predicted efficiently, in serial time O(t) or O(log t) in parallel. In this paper, we generalize this by looki...

Journal: :Theoretical Computer Science 1992

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید