4908 search results - page 344 / 982 » On the Complexity of Optimal K-Anonymity |
188
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
258
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
152
click to vote
UC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
178
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
200
Voted
ICMCS
2005
IEEE
16 years 11 days ago
2005
IEEE
The major complexity source in H.264 is the rate distortion (R-D) optimization. This work proposes a method to reduce the complexity of R-D analysis, paying a little video degrada...