4908 search results - page 783 / 982 » On the Complexity of Optimal K-Anonymity |
194
click to vote
MOBICOM
2004
ACM
16 years 1 hour ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
175
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
198
click to vote
WMPI
2004
ACM
15 years 12 months ago
2004
ACM
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past dec...
167
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
142
click to vote
CAISE
2004
Springer
15 years 12 months ago
2004
Springer
In architecture companies, work is very often performed by several individuals. From conceptual design to the construction of a final product, the object passes through many hands,...