Sciweavers

1464 search results - page 44 / 293
» On optimal anonymization for l -diversity
Sort
View
EOR
2006
62views more  EOR 2006»
14 years 12 months ago
A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
We propose a fully sequential indifference-zone selection procedure that is specifically for use within an optimization-via-simulation algorithm when simulation is costly, and par...
Juta Pichitlamken, Barry L. Nelson, L. Jeff Hong
COMPGEOM
2009
ACM
15 years 6 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
IPTPS
2004
Springer
15 years 5 months ago
DHT Routing Using Social Links
— The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existin...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
15 years 1 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
AAAI
2006
15 years 1 months ago
Handling Self-Interest in Groups, with Minimal Cost
In group decision-making problems that involve selfinterested agents with private information, reaching socially optimal outcomes requires aligning the goals of individuals with t...
Ruggiero Cavallo