2570 search results - page 22 / 514 » Fast Algorithms For The Computation Of Ranklets |
ESA
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
CGF
2011
14 years 4 months ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
70
Voted
SAC
2008
ACM
14 years 9 months ago
2008
ACM
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distribut...
TIP
2010
14 years 4 months ago
2010
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
JCPHY
2011
14 years 21 days ago
2011
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...