549 search results - page 21 / 110 » On the Complexity of Restricted k-anonymity Problem |
AIML
2004
14 years 11 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
160
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
IJCNN
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
EOR
2008
14 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...