549 search results - page 61 / 110 » On the Complexity of Restricted k-anonymity Problem |
CSL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
ICWL
2010
Springer
14 years 7 months ago
2010
Springer
Learning path construction is a complex task. It involves formulating and organizing learning activities, defining ways to evaluate student learning progress and to match such prog...
PODS
2001
ACM
15 years 10 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
103
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...