11016 search results - page 531 / 2204 » Cloud Computing for Science |
192
click to vote
TCS
2011
15 years 2 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
339
click to vote
Lecture Notes
Density estimation using nonparametric techniques by Aly A. Farag and Gimel'farb.
296
click to vote
Source Code
This page contains several methods using variational methods on the GPU.