Sciweavers

686 search results - page 63 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
162
Voted
FOCS
2009
IEEE
15 years 10 months ago
Extracting Correlations
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
114
Voted
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 7 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
142
Voted
DAC
2007
ACM
16 years 4 months ago
Synthesizing Stochasticity in Biochemical Systems
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
Brian Fett, Jehoshua Bruck, Marc D. Riedel
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 8 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
141
Voted
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
15 years 4 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg