Sciweavers

1722 search results - page 33 / 345
» On the sample mean of graphs
Sort
View
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
14 years 11 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
ECCV
2000
Springer
15 years 2 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth
CORR
2008
Springer
109views Education» more  CORR 2008»
14 years 10 months ago
Reconstruction of Multidimensional Signals from Irregular Noisy Samples
We focus on a multidimensional field with uncorrelated spectrum, and study the quality of the reconstructed signal when the field samples are irregularly spaced and affected by in...
Alessandro Nordio, Carla-Fabiana Chiasserini, Eman...
BMCBI
2006
95views more  BMCBI 2006»
14 years 10 months ago
A simple method for assessing sample sizes in microarray experiments
In this short article, we discuss a simple method for assessing sample size requirements in microarray experiments. Our method starts with the output from a permutation-based anal...
Robert Tibshirani
ICANN
2010
Springer
14 years 11 months ago
Exploring Continuous Action Spaces with Diffusion Trees for Reinforcement Learning
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
Christian Vollmer, Erik Schaffernicht, Horst-Micha...