Sciweavers

686 search results - page 28 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
152
Voted
TIT
2010
107views Education» more  TIT 2010»
14 years 10 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
147
Voted
FOCS
2006
IEEE
15 years 9 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 4 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
128
Voted
ICML
2010
IEEE
15 years 4 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
CP
2006
Springer
15 years 7 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter