IgnouGroup Social Campus
Problem Detail: I have the following Bayesian Network and need help with answering the following query. EDITED: Here are my solutions to questions a and b: a) P(A,B,C,D,E) = P(A) * P(B) * P(C | A, B) * P(D | E) Read More …
Problem Detail: I read on Wikipedia and in lecture notes that if a lossless data compression algorithm makes a message shorter, it must make another message longer. E.g. In this set of notes, it says: Consider, for example, the 8 possible Read More …
Problem Detail: Let $p$ be the six-figure Boolean function with the following definition: $p(x_{0},x_{1},x_{2},x_{3},x_{4},x_{5})=begin{cases} true & text{if } x_{0}=x_{5} text{ and } x_{1}=x_{4} text{ and } x_{2}=x_{3}, false & text{else.} end{cases}$ This function obviously yields $true$ iff $x_{0}x_{1}x_{2}x_{3}x_{4}x_{5}$ is a Read More …
Problem Detail: I am trying to find out why $(log(n))^{99} = o(n^{frac{1}{99}})$. I tried to find the limit as this fraction goes to zero. $$ lim_{n to infty} frac{ (log(n))^{99} }{n^{frac{1}{99}}} $$ But I’m not sure how I can reduce this Read More …
Problem Detail: Given a $0,1$ (binary) integer program of the form: $$ begin{array}{lll} text{min} & f(x) & text{s.t.} &Avec{x} = vec{b} & quad forall i &x_ige 0 & quad forall i &x_i in {0,1} & quad forall i end{array} $$ Note: Read More …
Problem Detail: Today, a talk by Henning Kerstan (“Trace Semantics for Probabilistic Transition Systems”) confronted me with category theory for the first time. He has built a theoretical framework for describing probablistic transition systems and their behaviour in a general way, Read More …
Problem Detail: I’m surprised that people keep adding new types in type theories but no one seems to mention a minimal theory (or I can’t find it). I thought mathaticians love minimal stuff, don’t they? If I understand correctly, in a Read More …
Problem Detail: Exercise 2.3-7 from “Introduction to Algorithms” by Cormen et al. Third Edition, states: Describe a O(n lg n)-time algorithm that, given a set S of n integers and another integer x, determines whether of not there exist two elements Read More …
Problem Detail: I understand the basis of A* as being a derivative of Dijkstra, however, I recently found out about D*. From Wikipedia, I can understand the algorithm. What I do not understand is why I would use D* over Dijkstra. Read More …
Problem Detail: In my lecture notes, the definition of the class NP is given as: A language $L$ is in the class NP, if there exists a turing machine $M$ and polynomials $T$ and $p$ such that: For every input $x$, Read More …
