260 search results - page 27 / 52 » Hardness of Parameterized Resolution |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
We extend a particular access control framework, the Privilege Calculus, with a possibility to override denied access for increased flexibility in hard to define or unanticipated...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...