April 13th, 2012, 01:43 AM
It looks like this suggestion actually is patented.
http://www.google.com.tw/patents/about?id=kQwWAAAAEBAJ
It's not that surprising really because median filtering is an important way to reduce...
April 12th, 2012, 01:22 AM
My second suggestion is to replace the binary search trees with fibonacci heaps, a max-heap for the left partition and a min-heap for the right. The total complexity will be the same but since many...
April 12th, 2012, 12:21 AM
In support of my previous suggestion here's a link that shows updates in O(1) are possible indeed,
http://www.tcs.fudan.edu.cn/rudolf/Paper/248tree_ijfcs.pdf
My suggestion requires that succ...
April 11th, 2012, 02:52 PM
I don't know for sure but I have a suggestion.
Say there's a search tree that's used to keep the numbers within the sliding window in sorted order. The median is the middle number in the tree.
...
