4908 search results - page 22 / 982 » On the Complexity of Optimal K-Anonymity |
136
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
101
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
141
click to vote
ISAAC
1993
Springer
15 years 6 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proposes a novel architecture synthesis algorithm for single-loop single-bit ∆Σ modulators. We defined a generic modulator architecture and derived its noise and si...
129
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...