549 search results - page 95 / 110 » On the Complexity of Restricted k-anonymity Problem |
ALT
1995
Springer
15 years 1 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
STOC
2010
ACM
15 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...