The role mining problem: finding a minimal descriptive set of roles

J Vaidya, V Atluri, Q Guo - Proceedings of the 12th ACM symposium on …, 2007 - dl.acm.org
Devising a complete and correct set of roles has been recognized as one of the most
important and challenging tasks in implementing role based access control. A key problem …

Boolean-width of graphs

BM Bui-Xuan, JA Telle, M Vatshelle - Theoretical Computer Science, 2011 - Elsevier
We introduce the graph parameter boolean-width, related to the number of different unions
of neighborhoods–Boolean sums of neighborhoods–across a cut of a graph. For many …

The role mining problem: A formal perspective

J Vaidya, V Atluri, Q Guo - ACM Transactions on Information and System …, 2010 - dl.acm.org
Devising a complete and correct set of roles has been recognized as one of the most
important and challenging tasks in implementing role-based access control. A key problem …

A serially addressable, flexible current monitor for test fixture based I/sub DDQ//I/sub SSQ/testing

A Hales - Proceedings., International Test Conference, 1995 - ieeexplore.ieee.org
The Quality Test Action Group (QTAG) was formed at the 1993 International Test Conference
to define a standard for test fixture based off-chip quiescent current monitors for use in the …

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

BM Bui-Xuan, JA Telle, M Vatshelle - arXiv preprint arXiv:0903.4796, 2009 - arxiv.org
We introduce the graph parameter boolean-width, related to the number of different unions
of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is …

[PDF][PDF] On the largest monochromatic combinatorial rectangles with an application to communication complexity

A Matos, A Teixeira, A Souto - Proceedings of the Computability in …, 2010 - academia.edu
The concept of combinatorial rectangle is of fundamental importance in Communication
Complexity. Given a finite set R, a combinatorial rectangle is a set of the form A× B where A …

A set coverage problem

GQ Zhang, L Cui - Information processing letters, 2010 - Elsevier
This paper shows that with B={1, 2,…, n}, the smallest k such that is s (n), where s (n) is the
smallest integer k such that n⩽(k⌊ k2⌋). This provides a simple set-based formulation and a …

Machine Learning Techniques as Applied to Discrete and Combinatorial Structures

SD Schwartz - 2019 - search.proquest.com
Abstract Machine Learning Techniques have been used on a wide array of input types:
images, sound waves, text, and so forth. In articulating these input types to the almighty …