Results 81 to 90 of about 14,682 (204)
Voxel-space shape grammars [PDF]
, 2012 The field of Procedural Generation is being increasingly used in modern content generation for its ability to significantly decrease the cost and time involved.
Crumley, Zacharia, Crumley, Mr. Zacharia
core
Progressive Dimension-Independent Boolean Operations
, 2004 This paper introduces a new progressive multi-resolution approach for representating and processing polyhedral objects of any dimension. Our representation, a variant of BSP trees [Nay90] combined with the Split scheme introduced in [BP96], allows ...
Paoluzzi, A. +2 more
core +1 more source
Four-part semigroups - semigroups of Boolean operations
, 2012 Four-part semigroups form a new class of semigroups which became important when sets of Boolean operations which are closed under the binary superposition operation f + g := f(g,...,g), were studied.
Jampachon, Prakit +2 more
core +1 more source
State Complexity of the Star of a Boolean Operation
48 pages, submitted to ...
Pascal Caron +2 more
openaire +2 more sources
EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores
SensorsTo address the deficiencies in privacy-preserving expressive query and verification mechanisms in outsourced key-value stores, we propose EKV-VBQ, a scheme designed to ensure verifiable Boolean queries over encrypted key-value data.
Yuxi Li +3 more
doaj +1 more source
Logical recognition in the space of multivalued attributes [PDF]
Computer Science Journal of Moldova, 1994 A logical approach to the problem of recognition is proposed, that is based on searching for implicative regularities, constructing a knowledge base and its applying to the computation of the goal attributes values. Sectional Boolean vectors and matrices
A. Zakrevsky
doaj
Perfect contrast visual cryptography scheme
Tongxin xuebao, 2009 A perfect contrast visual cryptography scheme with the best contrast based on both the perfect black visual cryptography scheme（PBVCS） and the non-perfect black visual cryptography scheme（NPBVCS） was proposed.The proposed scheme applied simple Boolean ...
HAN Yan-yan1, HE Wen-cai1, HU Yu-pu1
doaj +2 more sources
Computing the Boolean Product of Two n x n Boolean Matrices Using O(n(2)) Mechanical Operations
, 2020 We study the problem of determining the Boolean product of two n x n Boolean matrices in an unconventional computational model allowing for mechanical operations. We show that O(n(2)) operations are sufficient to compute the product in this model.
Lingas, Andrzej,, Persson, Mia,
core
Short Formulations of Boolean Algebra, Using Ring Operations
, 1951 Special interest has recently attached to formulations of Boolean algebra in terms of ring operations [7], [1]. These axiomatizations have not been as brief as those reached through other modes of approach.
Lee Byrne
core +1 more source