Sciweavers

1369 search results - page 192 / 274
» Lattice computations for random numbers
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
TAMC
2010
Springer
14 years 2 months ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
ATAL
2010
Springer
13 years 10 months ago
On the limits of dictatorial classification
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
POPL
2012
ACM
12 years 4 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
CIBCB
2006
IEEE
14 years 1 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...