153 search results - page 6 / 31 » An Empirical Analysis of Approximation Algorithms for Euclid... |
IPCO
2001
13 years 8 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
ICANN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...
LATIN
2010
Springer
14 years 17 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
TSP
2010
13 years 2 months ago
2010
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
TSP
2011
13 years 1 months ago
2011
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...