549 search results - page 27 / 110 » On the Complexity of Restricted k-anonymity Problem |
101
click to vote
ORL
2008
14 years 11 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
142
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
100
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
COMPSEC
2010
14 years 10 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
103
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...