Author: ignougroup

Problem Detail: In mathematics , an $n$-ary relation is subset of cross product on $n$ sets took under consideration. Let us take $A_1,A_2,A_3 cdots A_n$ be the n sets. Then relation $R subseteq A_1times A_2times A_3 times A_n$ . Here $X$ Read More …

Problem Detail: Note: This is a part of a homework question Were asked to construct a multi-tape Turing Machine for language {$a^n b^n c^n mid n geq 0$} Then it says “Discuss how much time your machines saves over a one-tape Read More …

Problem Detail: A forest is a collection of trees. Is there a similar notion for paths? e.g., a _______ is a collection of paths. Asked By : Austin Buchanan Answered By : David Richerby Wikipedia says that a graph all of whose non-trivial Read More …

Problem Detail: I have a weighted directed graph (it’s sparse, 35,000 nodes and 19 million edges) and would like to calculate similarity scores for pairs of nodes. SimRank would be ideal for this purpose, except that it applies to unweighted graphs. Read More …

Problem Detail: I’m asked to prove that, if P=NP, that 0*1* is NP-complete, but I’m having trouble going about doing it. I know it’s fairly easy to prove it’s NP by creating a TM to verify an input (which can be Read More …

Problem Detail: Let $N(G)$ be the null graph. What’s the number of vertex cover for this graph? I wanted to modify the reduction from SAT to vertex cover by adding vertices that are not connect to any vertices. Asked By : Fayez Read More …

Problem Detail: Suppose I am given a finite set of points $p_1,p_2,..p_n$ in the plane, and asked to draw a twice-differentiable curve $C(P)$ through the $p_i$’s, such that its perimeter is as small as possible. Assuming $p_i=(x_i,y_i)$ and $x_i<x_{i+1}$, I can Read More …

Problem Detail: This is about basic machine learning which I do not understand clearly. I have 2 Gaussian models $G_1$ and $G_2$ and given a list of data as below. (1, 3, 4, 5, 7, 8, 9, 13, 14, 15, 16, Read More …

Problem Detail: Suppose we have a balanced binary tree, which represents a recursive partitioning of a set of $N$ points into nested subsets. Each node of the tree represents a subset, with the following properties: subsets represented by two children nodes Read More …

Problem Detail: Suppose a person states the following: $n^2 = (n * n), forall n > 0$. One can check such equality by saying, via proof by induction, that: for $n := 0: 0^2 = (0 * 0)$; for $n := Read More …