4908 search results - page 341 / 982 » On the Complexity of Optimal K-Anonymity |
234
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
235
click to vote
TMC
2011
15 years 1 months ago
2011
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...
244
click to vote
JMLR
2010
15 years 1 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
230
click to vote
PAMI
2010
15 years 1 months ago
2010
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
204
click to vote
TON
2012
13 years 9 months ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...