107 search results - page 1 / 22 » On the Optimal Selection of k in the k-Anonymity Problem |
171
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
OPODIS
2003
14 years 10 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
CP
2006
Springer
15 years 1 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...