9842 search results - page 431 / 1969 » The Complexity of the Matching-Cut Problem |
141
click to vote
CCS
2006
ACM
15 years 8 months ago
2006
ACM
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
169
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
164
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
118
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
154
click to vote
ESORICS
1998
Springer
15 years 9 months ago
1998
Springer
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...