4908 search results - page 687 / 982 » On the Complexity of Optimal K-Anonymity |
172
Voted
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
176
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract--Cognitive radio (CR) technology is an innovative radio design philosophy which aims to increase spectrum utilization by exploiting unused spectrum in dynamically changing...
215
click to vote
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
167
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
204
click to vote
RIVF
2008
15 years 8 months ago
2008
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...