4908 search results - page 358 / 982 » On the Complexity of Optimal K-Anonymity |
208
click to vote
TSP
2011
15 years 1 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
220
click to vote
TSP
2010
15 years 1 months ago
2010
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
217
click to vote
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
237
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
218
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...