Sciweavers

5580 search results - page 230 / 1116
» Randomized priority algorithms
Sort
View
WSCG
2004
142views more  WSCG 2004»
15 years 6 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
JMLR
2006
135views more  JMLR 2006»
15 years 5 months ago
Quantile Regression Forests
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
Nicolai Meinshausen
CISS
2007
IEEE
15 years 11 months ago
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
Alvaro A. Cárdenas, George V. Moustakides, ...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 11 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 5 months ago
A statistical mechanical interpretation of algorithmic information theory
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
Kohtaro Tadaki