Problem Detail: Specifications in Kripke structures are verified by Computation tree logic (CTL). However, refering to this Wikipedia article the CTL-operators are relative to a current state. So, when we want to verify if EF q is satisfied in a Kripke Read More …
Category: Uncategorized
[Solved]: When can one use a $O(n)$ time sorting algorithm?
Problem Detail: Some sorting algorithms like counting sort/insertion sort can work in $O(n)$ time while other algorithms such as quicksort require $O(n log n)$ time. As I understand it, it’s not always possible to use the $O(n)$ sorting algorithms. What are Read More …
[Solved]: What does the posterior probability of a variable mean in the Bayes’ rule?
Problem Detail: I have been studying Artificial Intelligence and I have noticed that the Bayes’ rule allows us to infer the posterior probability if a variable. But, my question is, what does the word, or phrase, ‘posterior’ mean in this context Read More …
[Solved]: If a DFA can be simulated by a real program, can it be simulated by a TM
Problem Detail: In proofs of decidability, we often want to simulate another model of computation by a Turing machine. But if I can simulate a $mathsf{DFA}$ by, say, a C program, then is there some result which says that the $mathsf{DFA}$ Read More …
[Solved]: Is developing an OCR considered a research project?
Problem Detail: Is developing an optical character recognition system for an alphabet which has no previous ocr considered a reputable conference or journal worthy research project, given the fact that there are so many commercial ocr system? Though, lots of conference Read More …
[Solved]: Data structures for general (non-tetrahedral) cell complexes
Problem Detail: For 2D polygonal meshes, the QuadEdge and HalfEdge data structure representations are sufficient to store and enable efficient query of all topological and incidence information. Are there compact and efficient data structures for 3D polyhedral meshes? I know there Read More …
[Solved]: How do you go about designing a vector processor architecture for the sum of matrix products?
Problem Detail: The following equation is a matrix expression where $B_i$ and $C_i^T$ are $ntimes n$ matrices and k is a positive integer: $$P = sum_{i=1}^k B_i C_i^T $$ So $P = B_1 C_1^T + B_2 C_2^T + cdots +B_k C_k^T Read More …
[Solved]: Find longest path between two disjoint sub-sets of vertices $V_1, V_2 subset V$ of a Graph
Problem Detail: I have a homework question which I would appreciate some help with: Let there be a DAG $G=(V,E)$ with positive weights. For every two different vertices $v_1, v_2$ we will define $D(v_1, v_2)$ to be the maximum length between Read More …
[Solved]: Concatenation of languages in NP
Problem Detail: I have a hard time to understand why the concatenation of two languages over an alphabet (concatenation is in NP), doesn’t imply that each of the languages for themselves are in NP. I talked with my Prof about the Read More …
[Solved]: Maximum non-intersecting subset of circles
Problem Detail: We are given a set of circles, stored by their center points in an array $A$. In particular, the center of the $i$th circle is at coordinates $(A[i].x, A[i].y)$. All the circles have radius of $k$. I want to Read More …
