I must confess that I’m passionate about algorithmic problems. These are that type of challenges that you can find on codechef, codeforces, hackerrank etc. These challenges require very little specialized knowledge, but a lot of logical thinking is needed instead. Although I’m not very much into programming competitions, I like to train my mind with algorithmic problems from time to time…just to keep me in good shape.
Suppose one day, your boss walks into the office with a job for you:
Boss: I want you to sort an array of data
You: Ok! Give me the input and I’ll deal with it
Boss: I don’t trust you and my data are sensible for me
You: If you don’t want to give me the data how am I supposed to sort it?
Boss: I don’t know! Find a solution! That’s why I pay you 😤
How can you sort an array of data if you can’t have the data?
As with most problems where privacy matters, the answer…
In this post we will see how homomorphic encryption can be used to perform a mean filter over an encrypted image . Why would anyone do that? Well, as long as you do the processing locally, encryption doesn’t make sense, but if you want to use an online service, are you sure you want to give your personal images to a remote web server? If your answer is no, keep reading this post.
This post is about a simple but exciting experiment in which we will try with some C programming skills and some basic curve fitting ideas to experimentally verify the convergence of the harmonic series. We will plot the partial sums of the series and see which pattern fits the best. In this article, we will rediscover some basic facts about the harmonic series from a computation point of view.
The harmonic series is defined as S=1+1/2+1/3+1/4+… Its name derives from the musical harmonics.
Let S(n)=1+1/2+1/3+…1/n be a partial sum of the harmonic series. For example, the first three partial sums…
I’m a teaching assistant at the Military Technical Academy of Bucharest. My work is mostly experimental in the areas of machine learning and cryptography