4908 search results - page 250 / 982 » On the Complexity of Optimal K-Anonymity |
173
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
180
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
169
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
163
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
169
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...