4908 search results - page 733 / 982 » On the Complexity of Optimal K-Anonymity |
150
Voted
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
204
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
175
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standar...
153
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
142
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...