4908 search results - page 662 / 982 » On the Complexity of Optimal K-Anonymity |
175
click to vote
APVIS
2007
15 years 8 months ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
191
click to vote
DMIN
2007
15 years 8 months ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
189
click to vote
IJCAI
2007
15 years 8 months ago
2007
A key problem in playing strategy games is learning how to allocate resources effectively. This can be a difficult task for machine learning when the connections between actions a...
198
click to vote
NIPS
2008
15 years 8 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
190
click to vote
OPODIS
2007
15 years 8 months ago
2007
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...