4908 search results - page 771 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
SIPS
2006
IEEE
16 years 18 days ago
2006
IEEE
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
155
click to vote
TRIDENTCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— Experiments in real satellite testbeds are relatively rare in practice. In this paper, we are going to share our experience on using one, and comment on selected sets of result...
155
click to vote
MOBICOM
2006
ACM
16 years 16 days ago
2006
ACM
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
174
click to vote
NETGAMES
2006
ACM
16 years 16 days ago
2006
ACM
Massively Multiplayer Online Games (MMOG) require novel, scalable network architectures for a high amount of participating players in huge game worlds. Consequently, new and compl...
167
click to vote
SIGCOMM
2006
ACM
16 years 16 days ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...