5115 search results - page 534 / 1023 » On Randomized Lanczos Algorithms |
187
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
The Christmas gift exchange is a popular party game played around Christmas. Each participant brings a Christmas present to the party, and a random ordering of the participants, ac...
170
click to vote
SIGGRAPH
1994
ACM
15 years 11 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
165
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
210
click to vote
ICRA
2000
IEEE
15 years 10 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
197
click to vote
COLT
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....