4908 search results - page 836 / 982 » On the Complexity of Optimal K-Anonymity |
164
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
182
click to vote
AICOM
2005
15 years 6 months ago
2005
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
191
click to vote
TCOM
2008
15 years 6 months ago
2008
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
181
click to vote
TCOM
2008
15 years 6 months ago
2008
: Due to correlated fading in frequency hopping (FH) wireless communication systems, it is possible to predict the future channel state information (CSI) for one frequency based on...
159
click to vote
IPL
2007
15 years 6 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...