Sciweavers

Share
226 search results - page 1 / 46
» Efficient sampling of random permutations
Sort
View
JDA
2008
100views more  JDA 2008»
9 years 2 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
ICML
2007
IEEE
10 years 3 months ago
A permutation-augmented sampler for DP mixture models
We introduce a new inference algorithm for Dirichlet process mixture models. While Gibbs sampling and variational methods focus on local moves, the new algorithm makes more global...
Percy Liang, Michael I. Jordan, Benjamin Taskar
WSC
1997
9 years 3 months ago
Descriptive Sampling: An Improvement over Latin Hypercube Sampling
Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
Eduardo Saliby
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
9 years 3 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
SUTC
2010
IEEE
9 years 26 days ago
Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor Networks
—Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compres...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nee...
books