Author: ignougroup

Problem Detail: We have a graph $G=(V,E)$ and we need to divide this graph into two clusters $A$ and $B$. Some pairs of vertices $u$, $v$ should not be in the same cluster, and we define an edge $(u,v) in E$. Read More …

Problem Detail: I’m writing insertion sort in scheme, but due to the difficulty of writing it recursively within the constraints of list processing of scheme, I made what seems like an insignificant change to the “find lowest” or inner loop. I’ll Read More …

Problem Detail: I am reading about a specific field of probabilistic programming, and trying to understand what the term “stateful computation” means. See: http://projects.csail.mit.edu/church/wiki/Simple_Generative_Models (search for “XRP”) Asked By : Astrid Answered By : Shreesh Stateful computation basically means that the model of Read More …

Problem Detail: I understand the basics of how left-recursion works, and why some people say it’s bad. And I’ve also ready opinions such as: …like LL and LR parsing, PEGs are often frustrating to use in practise. This is, principally, because Read More …

Problem Detail: Consider a static set $S$ of positive numbers from range $[1..10^9]$. Is there an efficient algorithm to answer queries of the form: “Given a number $d$ is there an element $x in S$ such that $d | x$”. Simple Read More …

Problem Detail: Given a sequence of comparable objects $a_1, a_2, ldots a_n,$ how quickly can we find the longest subsequence $s$ such that $s_i > s_1$ for $i > 1$? Or equivalently, how quickly can we find $$ underset{i}{argmax} ; # Read More …

Problem Detail: I’m looking at this tutorial on neural networks. The data that is given from the UCI study includes various attributes, such as “mean x of on pixels”, “total # on pixels” etc, which are taken as input to the Read More …

Problem Detail: what is the difference between memory access and data memory access? for example, here are the examples of register transfer language instructions: $R1 ←[18]$ $R2 ←[R1 +3]$ $R1 ← R1 +2$ $[8] ← R1$ From my understanding, memory access Read More …

Problem Detail: In unification, given a set of equations, a standard problem is to compute a most general unifier (mgu). I am interested in a somewhat reversed problem. Imagine having a set of equations that do not have an mgu, like Read More …

Problem Detail: I was wondering what the complexity of the following problem is: Given: A flow network $N$ with a source $s$, sink $t$ and a number $k$. Question: Is there an $s$-$t$ cut of capacity at most $k$? Obviously, the Read More …