世界首个「隐私屏」，用技术防偷看
Сайт Роскомнадзора атаковали18:00
。关于这个话题，同城约会提供了深入分析
antirez.com/news/158
If the number of candidates for each pixel grows too large (as is common in algorithms such as Knoll and Yliluoma) then sorting the candidate list for every pixel can have a significant impact on performance. A solution is to instead sort the palette in advance and keep a separate tally of weights for every palette colour. The weights can then be accumulated by iterating linearly through the tally of sorted colours.