4908 search results - page 322 / 982 » On the Complexity of Optimal K-Anonymity |
216
click to vote
AAAI
2012
13 years 9 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
142
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
For reconstructing a complex object wavefront from digital holograms, we propose a new penalized-likelihood approach based on the measurement statistics and edge-preserving regula...
203
click to vote
IPMI
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
145
click to vote
WIA
2004
Springer
16 years 2 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
161
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...