4908 search results - page 357 / 982 » On the Complexity of Optimal K-Anonymity |
183
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
180
click to vote
TNN
1998
15 years 6 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
150
Voted
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
— In this work, we proposed a reliability-based enhancement for the Viterbi and the optimal decoding of the convolutional tailbiting codes (CTBC) from the observations that the d...
185
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
169
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies the problem of energy conservation of mobile terminals in a multi-cell TDMA network supporting real-time sessions. The corresponding optimization problem involv...