549 search results - page 83 / 110 » On the Complexity of Restricted k-anonymity Problem |
BMVC
2010
14 years 7 months ago
2010
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
101
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
124
click to vote
LPAR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
BMCBI
2007
14 years 9 months ago
2007
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...