4908 search results - page 832 / 982 » On the Complexity of Optimal K-Anonymity |
143
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
During recent years, microelectronics helped to develop complex and varied technologies. It appears that many of these technologies can be applied successfully to realize Seebeck ...
197
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
216
click to vote
JSAC
2008
15 years 6 months ago
2008
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
160
click to vote
JFR
2006
15 years 6 months ago
2006
The Defense Applied Research Projects Agency (DARPA) Learning Applied to Ground Vehicles (LAGR) program aims to develop algorithms for autonomous vehicle navigation that learn how...
172
click to vote
MAGS
2008
15 years 6 months ago
2008
This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alt...