4908 search results - page 672 / 982 » On the Complexity of Optimal K-Anonymity |
162
click to vote
DSS
2008
15 years 6 months ago
2008
Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negoti...
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and ...
186
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
174
click to vote
DC
2006
15 years 6 months ago
2006
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...