Two variants of run-length encoding
are the diagram encoding and the pattern substitution algorithms. The
diagram encoding is actually a very simple...
1 replies - 4249 views - 01/24/12 by Stoimen Popov in Articles
In my previous post
we saw how to compress data consisting of very long runs of repeating
elements. This type of compression is known as “run-length...
0 replies - 3418 views - 01/17/12 by Stoimen Popov in Articles
No matter how fast today’s computers and networks are, the users will
constantly need faster and faster services. To reduce the volume of the
transferred...
0 replies - 2552 views - 01/10/12 by Stoimen Popov in Articles
I wrote about binary search
in my previous post, which is indeed one very fast searching algorithm,
but in some cases we can achieve even faster results....
0 replies - 4590 views - 01/03/12 by Stoimen Popov in Articles
The binary search is perhaps the most famous and best suitable search
algorithm for sorted arrays. Indeed when the array is sorted it is
useless to check...
1 replies - 4238 views - 12/27/11 by Stoimen Popov in Articles
The term property graph
has come to denote an attributed, multi-relational graph. That is, a
graph where the edges are labeled and both vertices and edges...
0 replies - 3788 views - 12/13/11 by Marko Rodriguez in Articles
Software Patents Get Strict
1 replies - 11630 views - 12/31/09 by Mitchell Pronsc... in Daily Dose
