Results 11 to 20 of about 250,057 (298)
Comparison of Access Control Approaches for Graph-Structured Data
Proceedings of the 21st International Conference on Security and CryptographyExtended version of an accepted paper at the 21st International Conference on Security and Cryptography (SECRYPT ...
Aya Mohamed 0001 +3 more
openaire +3 more sources
The lower bound and exact value of the information rate of some developed graph access structures
Proyecciones (Antofagasta), 2020 Various studies have focused on secret sharing schemes and in all of them, each shareholder is interested in a shorter share. The information rate of a secret sharing scheme shows the ratio between the size of the secret to the maximum number of shares given to each shareholder.
Cheraghi, Abbas
openaire +3 more sources
Global Energy Interconnection, 2023 Operation control of power systems has become challenging with an increase in the scale and complexity of power distribution systems and extensive access to renewable energy.
Kai Xiao +4 more
doaj +1 more source
Visual cryptography scheme on graphs with $m^{*}(G)=4$ [PDF]
Transactions on Combinatorics, 2019 Let $G=(V,E)$ be a connected graph and $\Gamma (G)$ be the strong access structure where obtained from graph $G$. A visual cryptography scheme (VCS) for a set $P$ of participants is a method to encode a secret image such that any pixel of this image ...
Mahmood Davarzani
doaj +1 more source
Entropy, 2022 Latent variable models (LVMs) for neural population spikes have revealed informative low-dimensional dynamics about the neural data and have become powerful tools for analyzing and interpreting neural activity.
Yicong Huang, Zhuliang Yu
doaj +1 more source
Optimal accessing and non-accessing structures for graph protocols
CoRR, 2011 An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an accessing set, and on the maximal size kappa(G) of a non-accessing set of a graph G.
Sylvain Gravier +3 more
openaire +2 more sources
GRAph Parallel Actor Language: A Programming Language for Parallel Graph Algorithms [PDF]
, 2013 We introduce a domain-specific language, GRAph Parallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
DeLorimier, Michael John
core +1 more source
Ideal Homogeneous Access Structures Constructed from Graphs [PDF]
J. Univers. Comput. Sci., 2009 Starting from a new relation between graphs and secret sharing schemes introduced by Xiao, Liu and Zhang, we show a method to construct more general ideal homogeneous access structures. The method has some advantages: it efficiently gives an ideal homogeneous access structure for the desired rank, and some conditions can be imposed (such as forbidden ...
openaire +3 more sources
Applications of concurrent access patterns in web usage mining [PDF]
, 2013 This paper builds on the original data mining and modelling research which has proposed the discovery of novel structural relation patterns, applying the approach in web usage mining.
Wang, Cuiqing +5 more
core +1 more source
Graph access structures with optimal pixel expansion three
Information and Computation, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Arumugam 0001 +2 more
openaire +2 more sources