Sciweavers

1207 search results - page 2 / 242
» Towards optimal k-anonymization
Sort
View
CIKM
2009
Springer
13 years 12 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
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,...
MLMI
2004
Springer
13 years 10 months ago
Towards Predicting Optimal Fusion Candidates: A Case Study on Biometric Authentication Tasks
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
Norman Poh, Samy Bengio
COLING
2010
13 years 9 days ago
Towards an optimal weighting of context words based on distance
Word Sense Disambiguation (WSD) often relies on a context model or vector constructed from the words that co-occur with the target word within the same text windows. In most cases...
Bernard Brosseau-Villeneuve, Jian-Yun Nie, Noriko ...
CEC
2011
IEEE
12 years 5 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...