Sciweavers

800 search results - page 21 / 160
» Gaussian random number generators
Sort
View
ICALP
2001
Springer
15 years 2 months ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
90
Voted
FCCM
2006
IEEE
138views VLSI» more  FCCM 2006»
15 years 1 months ago
Efficient Hardware Generation of Random Variates with Arbitrary Distributions
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
David B. Thomas, Wayne Luk
JMLR
2008
141views more  JMLR 2008»
14 years 9 months ago
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
Mathias Drton, Thomas S. Richardson
88
Voted
CLASSIFICATION
2010
14 years 7 months ago
Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study with Different Cluster Spreads
: The issue of determining "the right number of clusters" in K-Means has attracted considerable interest, especially in the recent years. Cluster intermix appears to be a...
Mark Ming-Tso Chiang, Boris Mirkin
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 3 months ago
DCMA: yet another derandomization in covariance-matrix-adaptation
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
Olivier Teytaud, Sylvain Gelly