Results 1  10
of
25,822
Parameterized Complexity of kAnonymity: Hardness and Tractability
, 2010
"... The problem of publishing personal data without giving up privacy is becoming increasingly important. A clean formalization that has been recently proposed is the kanonymity, where the rows of a table are partitioned in clusters of size at least k and all rows in a cluster become the same tuple, af ..."
Abstract
 Add to MetaCart
the complexity of the problem is influenced by different parameters. First we show that the problem is W[1]hard when parameterized by the value of the solution (and k). Then we exhibit a fixedparameter algorithm when the problem is parameterized by the number of columns and the maximum number of different
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Mondrian multidimensional kanonymity
 in Proc. 22nd ICDE. IEEE
"... KAnonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding “models ” have been considered for achieving kanonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (sing ..."
Abstract

Cited by 247 (5 self)
 Add to MetaCart
(singledimensional) approaches. Often this flexibility leads to higherquality anonymizations, as measured both by generalpurpose metrics, as well as more specific notions of query answerability. In this paper, we prove that optimal multidimensional anonymization is NPhard (like previous kanonymity
The effect of homogeneity on the complexity of kanonymity
 In Proc. 18th FCT, LNCS
"... Abstract. The NPhard kAnonymity problem asks, given an n × mmatrix M over a fixed alphabet and an integer s> 0, whether M can be made kanonymous by suppressing (blanking out) at most s entries. A matrix M is said to be kanonymous if for each row r in M there are at least k − 1 other rows in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
parameter tractable for the parameter tin, and it is NPhard even for tout = 2 and alphabet size four. Notably, our fixedparameter tractability result implies that kAnonymity can be solved in linear time when tin is a constant. Our results also extend to some interesting generalizations of kAnonymity. 1
UtilityPreserving kAnonymity
, 2006
"... As technology advances and more and more personspecific data like health information becomes publicly available, much attention is being given to confidentiality and privacy protection. On one hand, increased availability of information can lead to advantageous knowledge discovery; on the other han ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
hand, this information belongs to individuals and their identities must not be disclosed without consent. A recently proposed concept called kAnonymity addresses this conflict between doctorpatient confidentiality and societybeneficial research. Several kAnonymitybased problems have been proposed
Modeling and simulation of genetic regulatory systems: A literature review
 JOURNAL OF COMPUTATIONAL BIOLOGY
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 729 (15 self)
 Add to MetaCart
DNA, RNA, proteins, and small molecules. As most genetic regulatory networks of interest involve many components connected through interlocking positive and negative feedback loops, an intuitive understanding of their dynamics is hard to obtain. As a consequence, formal methods and computer tools
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical
An introduction to variational methods for graphical models
 TO APPEAR: M. I. JORDAN, (ED.), LEARNING IN GRAPHICAL MODELS
"... ..."
"GrabCut”  interactive foreground extraction using iterated graph cuts
 ACM TRANS. GRAPH
, 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract

Cited by 1140 (36 self)
 Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach based on optimization by graphcut has been developed which successfully combines both types of information. In this paper we extend the graphcut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Thirdly, a robust algorithm for “border matting ” has been developed to estimate simultaneously the alphamatte around an object boundary and the colours of foreground pixels. We show that for moderately difficult examples the proposed method outperforms competitive tools.
Results 1  10
of
25,822