4908 search results - page 932 / 982 » On the Complexity of Optimal K-Anonymity |
116
click to vote
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
118
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
110
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Modern network processors support high levels of parallelism in packet processing by supporting multiple threads that execute on a micro-engine. Threads switch context upon encoun...
124
click to vote
P2P
2006
IEEE
15 years 5 months ago
2006
IEEE
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
100
click to vote
CASES
2006
ACM
15 years 5 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...