4908 search results - page 276 / 982 » On the Complexity of Optimal K-Anonymity |
161
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
174
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
189
click to vote
EMSOFT
2010
Springer
15 years 4 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
168
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
172
click to vote
JMM2
2007
15 years 6 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...