2333 search results - page 22 / 467 » Recursive Computational Depth |
CONCURRENCY
1998
13 years 7 months ago
1998
SIGCSE
2002
ACM
13 years 7 months ago
2002
ACM
CORR
2011
Springer
13 years 2 months ago
2011
Springer
TCS
2011
13 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) .
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Recently, methods for estimating 3D scene geometry or absolute scene depth information from 2D image content have been proposed. However, general applicability of these methods in...