10392 search results - page 450 / 2079 » Introduction to Computer Science |
206
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) .
347
click to vote
Lecture Notes
Density estimation using nonparametric techniques by Aly A. Farag and Gimel'farb.
312
click to vote
Source Code
This page contains several methods using variational methods on the GPU.
329
click to vote
Publication
Foundations of Mechanism Design: A Tutorial - Part 2: Advanced Concepts and Results
250
click to vote
Presentation
Redistribution of VCG Payments in Assignments of Heterogeneous Objects