4908 search results - page 95 / 982 » On the Complexity of Optimal K-Anonymity |
164
click to vote
QSHINE
2005
IEEE
15 years 12 months ago
2005
IEEE
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
190
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
182
click to vote
ISAAC
2009
Springer
16 years 28 days ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
184
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
171
click to vote
IPCO
2007
15 years 7 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...