4908 search results - page 628 / 982 » On the Complexity of Optimal K-Anonymity |
177
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
180
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
153
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
173
click to vote
NETCOOP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
151
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...