4908 search results - page 40 / 982 » On the Complexity of Optimal K-Anonymity |
193
click to vote
JMLR
2012
13 years 8 months ago
2012
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
168
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
135
click to vote
CEJCS
2011
14 years 6 months ago
2011
: Network analytic method designed for the analysis of static networks promise to identify significant relational patterns that correlate with important structures in the complex ...
203
click to vote
TSMC
2010
15 years 24 days ago
2010
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
172
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...