4908 search results - page 27 / 982 » On the Complexity of Optimal K-Anonymity |
152
click to vote
WSC
2008
15 years 4 months ago
2008
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
118
click to vote
CAD
2005
Springer
15 years 1 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
102
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
124
click to vote
ISSS
1999
IEEE
15 years 6 months ago
1999
IEEE
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
113
click to vote
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
The H.264/ACV standard provides significant improvements in performance over earlier video coding standards at the cost of increased complexity. Our challenge is to determine H.26...