Results 221 to 230 of about 4,554,873 (311)
Some of the next articles are maybe not open access.
Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations
Journal of Information Security and Applications, 2019In a (n, n)-secret image sharing scheme, a secret image is distributed among n parties in such a way that cooperation of all the shares is needed for reconstruction of the original secret image.
Saeideh Kabirirad, Ziba Eslami
semanticscholar +1 more source
Comput. Aided Des., 2019
Boolean operations are fundamental for geometric modeling, but the resulting objects, defined by trimmed surfaces, are often difficult to edit directly, possess robustness issues, and lead to problems of watertightness for downstream users.
B. Urick +5 more
semanticscholar +1 more source
Boolean operations are fundamental for geometric modeling, but the resulting objects, defined by trimmed surfaces, are often difficult to edit directly, possess robustness issues, and lead to problems of watertightness for downstream users.
B. Urick +5 more
semanticscholar +1 more source
Progressive (k, n) secret image sharing schemes based on Boolean operations and covering codes
Signal processing. Image communication, 2018( k , n ) progressive secret image sharing (PSIS) schemes were discussed frequently in recent years. A ( k , n ) PSIS scheme consists of sharing phase and reconstruction phase. During sharing phase, a secret image is encrypted into n image-shadows; while
Yanxiao Liu +3 more
semanticscholar +1 more source
A (t, n)-multi secret image sharing scheme based on Boolean operations
Journal of Visual Communication and Image Representation, 2018In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are shared among n users so that participation of at least t of them is needed to recover the shared images.
Saeideh Kabirirad, Ziba Eslami
semanticscholar +1 more source
Boolean Logic Computing Based on Neuromorphic Transistor
Advanced Functional Materials, 2023General‐purpose computers usually use logic gate computing units based on complementary metal oxide semiconductors (CMOS). Due to the separate memory and computing units in Von Neumann architecture, data transmission requires great energy and time ...
Yifei Wang +6 more
semanticscholar +1 more source
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
Theory of Computing Systems, 2017A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set.
Sylvie Davies
semanticscholar +1 more source
Symmetric Groups and Quotient Complexity of Boolean Operations
International Colloquium on Automata, Languages and Programming, 2013The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L′ are binary regular languages with quotient complexities m and n, and that the subgroups of ...
J. Bell +3 more
semanticscholar +1 more source
Streaming Dyadic Boolean Operations
Fifth International Conference on Information Technology: New Generations (itng 2008), 2008We investigate the specification and implementation of iterator components for dyadic Boolean operations in the setting of stream functions and state transition machines. We explicate the approach for the Boolean conjunction and study iterator components repeating this operation.
Walter Dosch, Annette St, T Tamme
openaire +1 more source
Boolean Functions Without Boolean Operators
1989The motivation for working without Boolean operators can mostly be found in the field of Boolean stochastics which will be treated in §§8 and 9. In the present chapter stochastic aspects will be precluded. Even today practical workers in many fields who apply Boolean functions are easily frustrated by the very idea of working without Boolean operators.
openaire +1 more source
Effects of programming tools with different degrees of embodiment on learning Boolean operations
Education and Information Technologies : Official Journal of the IFIP technical committee on Education, 2022Baichang Zhong, Liying Xia, Siyu Su
semanticscholar +1 more source