IgnouGroup Social Campus
Problem Detail: Is there any way to combine multiple Hidden Markov Models trained from different sets of data? For example, I want to detect the phases of a sequential activity. I collect two sets of data by using two types of Read More …
Problem Detail: We know the bellman-ford algorithms check all edges in each step, and for each edge if, d(v)>d(u)+w(u,v) then d(v) being updated such that w(u,v) is the weight of edge (u, v) and d(u) is the length of best finding Read More …
Problem Detail: The Wikipedia article on processor registers mentions: Address registers hold addresses and are used by instructions that indirectly access primary memory. Which addresses does this sentence refer to? Asked By : Registered User Answered By : Karolis Juodelė RAM addresses or Read More …
Problem Detail: I’m trying to check how general and valid protocol suite system ( layered structure ) are. Does anyone know if radio communication ( broadcast ) via AM or FM , for instance can be viewed in the light of Read More …
Problem Detail: A simple counting argument shows most strings can’t be compressed to shorter strings. But, compression is usually defined using Kolmogorov complexity. A string is compressible if its Kolmogorov complexity is less than its length, $K(s) < |s|$. The Kolmogorov Read More …
Problem Detail: I’ve been wondering lately how GPUs compute sines and cosines, and Google hasn’t helped me finding a precise answer. Initially, I was thinking that in order to make the computations as fast as possible, the GPU would use some Read More …
Problem Detail: If we are given an analysis of an algorithm to be, for example, $5n^3 + 100n^2 + 32n$, can we therefore say that $T(n) = O(n^3)$, and $T(n) = Theta(n^2)$, and $T(n) = Omega(n)$, and all of those be Read More …
Problem Detail: I’m a student reading a book on threads. And I got when I got to non-deterministic and parallel programs, I got a bit confused. I hope you can help me out. I understand the difference between concurrency and parallelism. Read More …
Problem Detail: I’m little confused by computing a time complexity for Dijkstra algorithm. It is said that the complexity is in $O(|V|^2)$ – Wikipedia – Dijkstra, which I understand. It’s because for each node, we could theoretically relax edges going to Read More …
Problem Detail: If $L = L(M)$ then $L$ is a subset of $L(M)$ and $L(M)$ is a subset of $L$. Can anyone clarify what does this mean? Asked By : makakas Answered By : Hendrik Jan This is just a set-theoretical equality. Two Read More …
