The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is …
As the world becomes increasingly connected, it is also more exposed to a myriad of cyber threats. We need to use multiple types of tools and techniques to learn and understand the …
K Yan, Y Tian, Y Wang, W Zeng… - Proceedings of the …, 2017 - openaccess.thecvf.com
Precise search of visually-similar vehicles poses a great challenge in computer vision, which needs to find exactly the same vehicle among a massive vehicles with visually similar …
Smart contracts deployed on permissionless blockchains, such as Ethereum, are accessible to any user in a trustless environment. Therefore, most smart contract applications …
R Belohlavek, V Vychodil - Journal of Computer and System Sciences, 2010 - Elsevier
We present a novel method of decomposition of an n× m binary matrix I into a Boolean product A○ B of an n× k binary matrix A and ak× m binary matrix B with k as small as …
Matrix decomposition methods represent a data matrix as a product of two factor matrices: one containing basis vectors that represent meaningful concepts in the data, and another …
A Ene, W Horne, N Milosavljevic, P Rao… - Proceedings of the 13th …, 2008 - dl.acm.org
We describe several new bottom-up approaches to problems in role engineering for Role- Based Access Control (RBAC). The salient problems are all NP-complete, even to …
With the growing adoption of role-based access control (RBAC) in commercial security and identity management products, how to facilitate the process of migrating a non-RBAC system …
With the rapid advances in computing and information technologies, traditional access control models have become inadequate in terms of capturing fine-grained, and expressive …