107 search results - page 13 / 22 » On the Optimal Selection of k in the k-Anonymity Problem |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
JSAC
2008
13 years 7 months ago
2008
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
STOC
2000
ACM
14 years 4 days ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
ICCV
2009
IEEE
15 years 23 days ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Linear inverse problems are very common in signal and image processing. Many algorithms that aim at solving such problems include unknown parameters that need tuning. In this work...