4908 search results - page 7 / 982 » On the Complexity of Optimal K-Anonymity |
104
click to vote
NAACL
2010
14 years 9 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
98
Voted
EOR
2011
14 years 3 months ago
2011
Due to its complexity, its challenging features, and its practical relevance, personnel scheduling has been heavily investigated in the last few decades. However, there is a relati...
146
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
104
click to vote
DLT
2009
14 years 9 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...