11 citations · 35 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
stat.CO2017★ 2 cited
The p-convolution forest: a method for solving graphical models with additive probabilistic equations
Oliver Serang
Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints betwee…
cs.MS2017★ 2 cited
Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture
Christian Knauth, Boran Adas, Daniel Whitfield +4
The bit-reversed permutation is a famous task in signal processing and is key to efficient implementation of the fast Fourier transform. This paper presents optimized C++11 impleme…