4908 search results - page 387 / 982 » On the Complexity of Optimal K-Anonymity |
284
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
161
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
172
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
207
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
173
click to vote
IDA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...