barvinograd
Instance Segmentation Without Proposals
Zanran – Search the web for data and statistics
18 Machine Learning Superstars Lectures (2009) [video]
Understanding the Bias-Variance Tradeoff
Bitcoin Transaction Graph : a Quantitative Analysis (by Adi Shamir)
Setting up a PostGIS db with OpenStreetMap data
Volatile: Almost Useless for Multi-Threaded Programming
Google search bug returns porn results
Hadoop Open Air Cluster - Heat & Dust issues?
Brain circuits run their own clocks
Re:Cyclic Tag System: 1 Line of Turing-Complete Code
on Saturday November 24, 2012 @05:10PM (#4826595)
thanks, I wasn't aware of that. Do you have the reference?
Re:Cyclic Tag System: 1 Line of Turing-Complete Code
on Saturday November 24, 2012 @05:09PM (#4826586)
I do have great interest in Wolfram point of view. There is still a lot of research to do in this area. It still feels like the second or third lecture in group theory, before you get to the good parts.
Cyclic Tag System: 1 Line of Turing-Complete Code
HTML5 Function Graph Plotter
Arithmetic Encoding Using Fixed-Point Math
Re:Memory Efficient String Compression in C#
on Saturday November 03, 2012 @02:23PM (#4737440)
tkelogg, I am realy happy you found the post interesting and informative. Sometimes one forget to explain things that may seem obvious and one thinks that the code speaks for itself when it doesn't. I'll keep your advice in mind when I'll write my next post. In the mean time I have edited the post and added some additional explanations. Thank You :)
Re:Memory Efficient String Compression in C#
on Saturday November 03, 2012 @12:28PM (#4736992)
You are right, it would go into the first generation and will be collected pretty quickly unless it is more than 85KB which many strings that you want to compress are. If you go into that string length you get into the Large Object Heap and that is a disaster.
Unsafe work should not be scary. If you check out the code of GetByteCount for UTF8 encoding (as an example) you will see that Microsoft did the same thing.