4908 search results - page 694 / 982 » On the Complexity of Optimal K-Anonymity |
214
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
247
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
208
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches have made their way...
197
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
243
click to vote
APBC
2004
15 years 8 months ago
2004
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...