4908 search results - page 121 / 982 » On the Complexity of Optimal K-Anonymity |
155
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
266
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
195
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
180
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...
209
click to vote
MOBICOM
2006
ACM
16 years 11 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...