Problem Detail: This is one of my assignments. I am not able to comprehend how to reduce the Turing machine domain to Classical planning domain. My understanding is that we have to essentially perform complexity analysis of classical planning domain. So Read More …
Author: ignougroup
[Solved]: Why do Bloom filters work?
Problem Detail: Let’s say I am using Bloom filters to create a function to check if a word exists in a document or not. If I pick a hash function to fill out a bit bucket for all words in my Read More …
[Solved]: What is Harrison hashing, its applications in web search engines?
Problem Detail: What is Harrison hashing and what are its applications in web searching? Can some one give me some relevant information? Update: I found it here , and is a part of M.Tech syllabus of a friend of mine. I Read More …
[Solved]: Combining multiple HMM models
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 …
[Solved]: Bellman-Ford Termination when there is no change on vertex weights?
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 …
[Solved]: categories of registers and and storage in them
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 …
[Solved]: Layered Structures
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 …
[Solved]: Are nearly all natural numbers compressible?
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 …
[Solved]: How do GPUs compute sines?
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 …
[Solved]: Given an analysis of an algorithm, can we get Big-O, Theta, and Omega from this analysis?
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 …
