4908 search results - page 87 / 982 » On the Complexity of Optimal K-Anonymity |
182
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
170
click to vote
IJCAI
2003
15 years 7 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
178
click to vote
UAI
2000
15 years 7 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
162
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
148
click to vote
TWC
2008
15 years 6 months ago
2008
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...