We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N
Abstract. This paper proposes an effective channel management framework which analyzes the user channel surfing behavior and constructs fast channel change stream consisting of use...
Md. Mamun-Or-Rashid, Dae Sun Kim, Choong Seon Hong
: We present a software package for fast pedigree reconstruction in natural populations using co-dominant genomic markers such as microsatellites and SNPs. If available, the algori...
Markus Riester, Peter F. Stadler, Konstantin Klemm