5115 search results - page 461 / 1023 » On Randomized Lanczos Algorithms |
178
click to vote
DASFAA
2010
IEEE
16 years 1 months ago
2010
IEEE
This demonstration presents a recently proposed join algorithm called DigestJoin. Optimized for solid-state drives (SSDs), DigestJoin aims at reducing intermediate join results and...
186
click to vote
FOCS
2000
IEEE
16 years 3 days ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
209
click to vote
ICANNGA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
200
click to vote
AAAI
2007
15 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
195
click to vote
NIPS
2003
15 years 9 months ago
2003
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....