4908 search results - page 382 / 982 » On the Complexity of Optimal K-Anonymity |
161
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...
222
click to vote
MCSS
2009
Springer
15 years 11 months ago
2009
Springer
- In this paper, we investigate a new approach for the spectrum allocation in UWB systems. This approach consists in a cross-layer scheme that takes into consideration the differen...
178
click to vote
PPSN
1992
Springer
15 years 11 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
202
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
187
click to vote
AIPS
2007
15 years 9 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...