4908 search results - page 749 / 982 » On the Complexity of Optimal K-Anonymity |
216
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
158
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given the complexity of parallel programs, developers often must rely on performance analysis tools to help them improve the performance of their code. While many tools support th...
186
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
188
click to vote
IRI
2008
IEEE
16 years 1 months ago
2008
IEEE
Freight transportation at distribution nodes such as marine ports, airports and rail yards has been putting tremendous environmental pressure in metropolitan areas. A prerequisite...
234
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...