Category: Uncategorized

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 am reading about dependent types theory in the Homotopy Type Theory online book. In section 1.3 of the Type Theory chapter, it introduces the notion of hierarchy of Universes: $mathcal{U}_0 : mathcal{U}_1 : mathcal{U}_2 : cdots$, where every Read More …

Problem Detail: I’m just learning about Turing Machines, and I’m a bit confused by the difference in formal description between Wikipedia and my textbook. My textbook says the following: $$M=langle Q,Sigma,Gamma,delta,q_{0},q_{accept}, q_{reject} rangle$$ where: $Q$ is the set of states, $Sigma$ Read More …

Problem Detail: I am trying to wrap my head around recursion and divide and conquer algorithms. Can someone provide a proof and explanation of how many times a list of n elements can be divided in 1/2 on both sides.. In Read More …

Problem Detail: Alexia Massalin’s Dissertation on Synthesis was a Phd thesis on Operating Systems that contained a concept called ‘Quajects’ (see Chapter 4). This is some additional commentary on the Phd Thesis. Best I can work out – a Quaject is Read More …

Problem Detail: Say that there are $n$ days and there is $x_1, x_2, …,x_n$ amount of data to process on each day. Your computer can process $s_1$ amount of work on the first day since rebooting your computer, $s_2$ work on Read More …

Problem Detail: Consider the following dinner party problem: Given a list of acquaintances, and a list containing all pairs of individuals who are not on speaking terms with each other, find the largest set of acquaintances you can invite to a Read More …

Problem Detail: I suppose the calculation should not be done by only two factors (average reading speed/words per minute, and word count). But at least by a third parameter, that in my opinion should measure the difficulty of the used vocabulary Read More …

Problem Detail: I was reading about decision problem. I understand that decision problem tell yes/no answer for an input. The decision is based on a decision procedure also called an algorithm. The wikipedia says that It is traditional to define the Read More …

Problem Detail: When we would like to prove lower bound comparison algorirthm, we often use decision tree, for example sorting by comparisons. So let’s consider find minimum in array $a[1..n]$ by comparison. Lower bound for that problem is commonly known – Read More …