5115 search results - page 178 / 1023 » On Randomized Lanczos Algorithms |
171
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
185
click to vote
WSCG
2004
15 years 8 months ago
2004
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...
201
Voted
JMLR
2006
15 years 6 months ago
2006
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...
172
click to vote
CISS
2007
IEEE
16 years 1 months ago
2007
IEEE
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 ...
160
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
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...