4908 search results - page 772 / 982 » On the Complexity of Optimal K-Anonymity |
163
click to vote
SIGMETRICS
2006
ACM
16 years 16 days ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
168
click to vote
CLUSTER
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
154
click to vote
CODES
2005
IEEE
16 years 6 days ago
2005
IEEE
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
153
click to vote
CODES
2005
IEEE
16 years 6 days ago
2005
IEEE
In this paper, we present a new architectural concept for network processors called FlexPath NP. The central idea behind FlexPath NP is to systematically map network processor (NP...
162
click to vote
DATE
2005
IEEE
16 years 6 days ago
2005
IEEE
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...