5115 search results - page 157 / 1023 » On Randomized Lanczos Algorithms |
188
click to vote
BERTINORO
2005
Springer
16 years 10 days ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
186
click to vote
AIMSA
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
186
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
190
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
271
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...