Sciweavers

3897 search results - page 494 / 780
» complexity 2010
Sort
View
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
16 years 6 days ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
SIGMOD
2010
ACM
176views Database» more  SIGMOD 2010»
16 years 6 days ago
DCUBE: discrimination discovery in databases
Discrimination discovery in databases consists in finding unfair practices against minorities which are hidden in a dataset of historical decisions. The DCUBE system implements t...
Salvatore Ruggieri, Dino Pedreschi, Franco Turini
SPAA
2010
ACM
16 years 6 days ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
SPAA
2010
ACM
16 years 6 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ACNS
2010
Springer
156views Cryptology» more  ACNS 2010»
16 years 6 days ago
Batch Groth-Sahai
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
Olivier Blazy, Georg Fuchsbauer, Malika Izabach&eg...