4908 search results - page 240 / 982 » On the Complexity of Optimal K-Anonymity |
160
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
205
click to vote
SMA
1999
ACM
15 years 11 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
176
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
194
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
187
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...