4908 search results - page 377 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
TON
2012
13 years 9 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
312
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
189
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
183
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
174
click to vote
ISCAS
2006
IEEE
16 years 26 days ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...