I posted this in another thread before. A mathematician offering his services. Maybe it's something for you?
Could you develop a fast algorithm to calculate the discrete cosine transform (or any daubechies wavelet) of a non-power-of-two amount of samples?
I need it to be ridiculously fast; perfect accuracy is not crucial.
I'm working on a video codec, which is working extremely well so far. I get very competitive compression ratio's compared to H265, but the computational complexity is just ridiculous. (realtime is far from possible, except for very low resolution video)
I need to do a DCT (or DWT) of sample sizes typically between 64 and 1024, usually around 700. It's fine if you come up with different algorithms, depending on the sample size.
Pseudocode is fine; preferably C/C++.
I'm willing to pay you a decent sum, if it's fast enough.
I find this challenging, I'll take you up on this challenge. See pm for details.
You have to give him 1 thing...excellent marketing skills for his services! I have no need for any coding work to be done, and would never have clicked if it were not for this topic title. If he can code as well as he makes topics - he might just be THE BEST!
@Blazedout419
Yes, I am THE BEST, I stay the best, and I will continue to be the best, no doubt.
Yes I'm very confident. If you have friends that need the best programmer, I'm here, let them know(refer them to this thread).
If you'll need coding work done in the future, you know where to find me.
No thanks. There are already 500 used copies of Teach yourself C++ in 21 days from members of the Alt coins section available.
OP, if you are the 'best programmer' I'm sure you would be up for a little wager right? Hey, if you beat a few people your claim might have some merit.
@siameze , @Welsh
Sorry haters, I'm not impressed by your performance. I stay composed. My mindset is the best.
Everyone else reading this: I'm the real deal (
points-at-chest), I'm the number one. If you need the best programmer, you know where to find me.
I'm right here every day.