Sciweavers

107 search results - page 1 / 22
» On the Optimal Selection of k in the k-Anonymity Problem
Sort
View
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
14 years 6 months ago
On the Optimal Selection of k in the k-Anonymity Problem
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...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 5 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
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...
Rhonda Chaytor
OPODIS
2003
13 years 6 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
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...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
ICTAI
2010
IEEE
13 years 2 months ago
PKOPT: Faster k-Optimal Solution for DCOP by Improving Group Selection Strategy
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 ...
Elnaz Bigdeli, Maryam Rahmaninia, Mohsen Afsharchi
CP
2006
Springer
13 years 8 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
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...
Matthew J. Streeter, Stephen F. Smith