4908 search results - page 298 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
SAIG
2000
Springer
15 years 10 months ago
2000
Springer
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
167
click to vote
AAAI
1998
15 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
201
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
190
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
187
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...