1055 search results - page 48 / 211 » Enumerations in computable structure theory |
CCS
2011
ACM
12 years 10 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
EMSOFT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...