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 …
Blog
[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]: 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]: 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]: 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]: does godel’s incompleteness theorem shed any light on dynamic vs typed languages?
Problem Detail: I’m clojure user myself. I’m trying really hard to learn haskell and to better understand the type system. However, I feel that trying to ‘type’ everything is quite restrictive when the problem or the data is less defined. I Read More …
[Solved]: Does ln n ∈ Θ(log2 n)?
Problem Detail: Is that statement false or true? I believe it’s false because ln(n) = log base e of n. So therefore, log base 2 of n can be a minimum because in 2^x = n, x will always be less Read More …
[Solved]: Notions of efficient computation
Problem Detail: A polynomial-time Turing machine algorithm is considered efficient if its run-time, in the worst-case, is bounded by a polynomial function in the input size. I’m aware of the strong Church-Turing thesis: Any reasonable model of computation can be efficiently Read More …
[Solved]: Detecting overflow in summation
Problem Detail: Suppose I am given an array of $n$ fixed width integers (i.e. they fit in a register of width $w$), $a_1, a_2, dots a_n$. I want to compute the sum $S = a_1 + ldots + a_n$ on a Read More …
[Solved]: Where do these DRAM row/column calculations come from?
Problem Detail: Let r be the number of rows in a DRAM array, and c be the number of columns. Apparently, DRAM with organization 16×1 requires least pins when r = c = 4 because fewer address bits are required to Read More …
