Sciweavers

4276 search results - page 234 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
NIPS
2008
15 years 6 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
COLING
2002
15 years 4 months ago
A Measure of Term Representativeness Based on the Number of Co-occurring Salient Words
We propose a novel measure of the representativeness (i.e., indicativeness or topic specificity) of a term in a given corpus. The measure embodies the idea that the distribution o...
Toru Hisamitsu, Yoshiki Niwa
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 5 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss
IWANN
2009
Springer
15 years 11 months ago
Development of Neural Network Structure with Biological Mechanisms
We present an evolving neural network model in which synapses appear and disappear stochastically according to bio-inspired probabilities. These are in general nonlinear functions ...
Samuel Johnson, Joaquín Marro, Jorge F. Mej...
DAGM
2004
Springer
15 years 10 months ago
A Probabilistic Framework for Robust and Accurate Matching of Point Clouds
We present a probabilistic framework for matching of point clouds. Variants of the ICP algorithm typically pair points to points or points to lines. Instead, we pair data points to...
Peter Biber, Sven Fleck, Wolfgang Straßer