4908 search results - page 193 / 982 » On the Complexity of Optimal K-Anonymity |
172
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
172
click to vote
SIROCCO
1998
15 years 7 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
173
click to vote
WCE
2007
15 years 7 months ago
2007
— In this paper a new approach to optimize nuclear power plant designs based on global risk reduction are described. In design the focus is on as components quality as redundancy...
177
click to vote
GRIDNETS
2008
15 years 7 months ago
2008
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
196
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...