Author: ignougroup

Problem Detail: Sudoku is well known puzzle which is known to be NP-complete and it is a special case of more general problem known as Latin squares. A correct solution of the $N times N$ square consists of filling every row Read More …

Problem Detail: I want to do image segmentation. in an article about A Level Set Method for Image Segmentation I saw that the outer use bias field estimation. I searched a lot but I couldn’t understand the meaning of bias field…What Read More …

Problem Detail: I thoroughly enjoyed my algorithms class but I felt that it lacked rigor. Most of the time I was able to intuitively understand why the algorithms presented worked and why they had the time complexity that was presented but Read More …

Problem Detail: I’m a little confused about the concept of the Bellman-Ford(BF) algorithm to compute the shortest path in a general graph with negative weights knowing that there are no negative cycles present. I understand why Dikjstra doesn’t work for a Read More …

Problem Detail: Within the field of cache-oblivious algorithms the ideal cache model is used for determining the cache complexity of an algorithm. One of the assumptions of the ideal cache model is that it models a “tall cache”. This is given Read More …

Problem Detail: From my own exploration of Google Deep Dream, largely with Dreamify for IOS, and also from Google Image results on the topic, a few of the images I have produced/seen have led me to 3 conclusions about the networks Read More …

Problem Detail: I have studied about both of these on many places like this, this and this, but still it is not that much clear that what the actual difference is between these two. The Wikipedia links (first and second links Read More …

Problem Detail: Couldn’t find much online on how an interactive system is different from a time-sharing system, or the different traits of both. My understanding of a time-sharing system is many people at terminals being able to use the system at Read More …

Problem Detail: I have a set $S$ and a set $P = {P_{1},…,P_{n}}$ with $bigcup P_{i} = S$. I want to find all the inclusion-minimal subsets of $P$ that are covers of $S$. What is the best algorithm for enumerating all Read More …