Sciweavers

1029 search results - page 171 / 206
» Probabilistic Recurrence Relations
Sort
View
127
Voted
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
15 years 4 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
SIGIR
2010
ACM
15 years 3 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
137
Voted
CGF
2008
129views more  CGF 2008»
15 years 3 months ago
Sequential Monte Carlo Adaptation in Low-Anisotropy Participating Media
This paper presents a novel method that effectively combines both control variates and importance sampling in a sequential Monte Carlo context. The radiance estimates computed dur...
Vincent Pegoraro, Ingo Wald, Steven G. Parker
104
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 3 months ago
A Bayesian Review of the Poisson-Dirichlet Process
The two parameter Poisson-Dirichlet process is also known as the PitmanYor Process and related to the Chinese Restaurant Process, is a generalisation of the Dirichlet Process, and...
Wray L. Buntine, Marcus Hutter
ECCC
2008
98views more  ECCC 2008»
15 years 3 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous