4908 search results - page 147 / 982 » On the Complexity of Optimal K-Anonymity |
163
click to vote
ICNC
2005
Springer
15 years 12 months ago
2005
Springer
Advances in grid computing have recently sparkled the research and development of Grid problem solving environments for complex design. Parallelism in the form of distributed compu...
172
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. Different approaches to infer the dependencies of gene r...
161
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
168
click to vote
ICISC
2008
15 years 8 months ago
2008
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
171
click to vote
AMW
2009
15 years 7 months ago
2009
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...