blog.adityon.com
Adityon » Society
http://blog.adityon.com/category/society
Simpler solution for complex problem. Think different – Keshav Shetty. Articles in the Society Category. 30 May 2010 by Keshav Shetty No Comment. Mother of all Oxymorons. An oxymoron is usually defined as a phrase in which two words of contradictory meaning are brought together:. And the Mother of all…… . . . . . . Bangalore city traffic police. 5 Apr 2010 by Keshav Shetty No Comment. Visit Bangalore city traffic police. Understand and follow all traffic sign in Bangalore and India – Traffic sign. Few pe...
blog.adityon.com
Adityon » Blog Archive » Random data compression – diff encoding with merge sort
http://blog.adityon.com/2010/10/random-data-compression-diff-encoding-with-merge-sort
Simpler solution for complex problem. Think different – Keshav Shetty. Raquo; Data compression. Random data compression – diff encoding with merge sort. 2 October 2010 by Keshav Shetty. Last article didn’t go well with my readers, so I decided to elaborate with example. Lets assume we have eight random input say 5, 1, 3, 1, 2, 3, 0, 5. In this input 4th, 6th and 8th element are non unique i.e they already appeared at least once. Lets go back to the algorithm mentioned in my previous article. Ie for 4th e...
blog.adityon.com
Adityon
http://blog.adityon.com/page/2
Simpler solution for complex problem. Think different – Keshav Shetty. Random data compression – One bit diff encoding. 5 Jun 2010 by Keshav Shetty 7 Comments. This is continuation of my previous article on Random data compression-How to use merge sort? Random data compression – Is it possible? How to use merge sort? 3 Jun 2010 by Keshav Shetty 7 Comments. This is continuation of my previous article on Random data compression possibilities. 30 May 2010 by Keshav Shetty No Comment. Mother of all Oxymorons.
blog.adityon.com
Adityon » Blog Archive » Random data compression – One bit diff encoding continued
http://blog.adityon.com/2010/10/random-data-compression-one-bit-diff-encoding-continued
Simpler solution for complex problem. Think different – Keshav Shetty. Raquo; Data compression. Random data compression – One bit diff encoding continued. 1 October 2010 by Keshav Shetty. This is continuation of my previous article on Random data compression-One bit dif encoding. Sorry for the long gap between this and last article. I was too busy. After my my previous article many had asked how I achieved compression up to 42 bytes duplicates. Here we go with the algorithm I used. Using above technique ...
blog.adityon.com
Adityon » Data compression
http://blog.adityon.com/category/data-compression
Simpler solution for complex problem. Think different – Keshav Shetty. Articles in the Data compression Category. Random data compression – Lowerband & upper band filtering. 9 Jan 2011 by Keshav Shetty 3 Comments. Wish you all happy new year 2011. In this article I will explain how a set of unique elements can be represented with less bits using filtering elements into two sets of upper and lower band. Random data compression – Risk based selection. 3 Oct 2010 by Keshav Shetty 2 Comments. In this article...
blog.adityon.com
Adityon » Blog Archive » Random data compression – Lowerband & upper band filtering
http://blog.adityon.com/2011/01/random-data-compression-lowerband-upper-band-filtering
Simpler solution for complex problem. Think different – Keshav Shetty. Raquo; Data compression. Random data compression – Lowerband & upper band filtering. 9 January 2011 by Keshav Shetty. Wish you all happy new year 2011. In this article I will explain how a set of unique elements can be represented with less bits using filtering elements into two sets of upper and lower band. Lets take the same the input used in previous article of size 16, i.e: (7, 12, 9, 3, 13, 6, 8, 15, 1, 4, 2, 11, 0, 14, 5, 10).
SOCIAL ENGAGEMENT