4908 search results - page 76 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
151
click to vote
ADHOCNOW
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
193
click to vote
JGAA
2007
15 years 6 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
147
click to vote
IPPS
2009
IEEE
16 years 25 days ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
148
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...