Top new questions this week:
|
|
There is an unknown matrix $A$ of $R$ rows and $C$ columns. The entry at the $r$-th row, $c$-th column is $A_{rc}$. The matrix is a binary matrix, i.e. each entry is either 0 or 1.
Another matrix $B$ ...
|
|
QUESTION
Is there any efficient way to encode words into bits, without having to draw the graphs, solely by only using a list of probabilities?
EXAMPLE
This list of words:
Pr('Apple') = 0.5.
Pr('...
|
|
I am doing a HW problem where I have L1 and L2.
I did the product construction method to produce all the new states of the DFA representing L1 and L2 (the number of states in L1 times the number of ...
|
|
I'm working on a new general-purpose programming language. Exception handling is supposed to be like in Rust, but simpler. I'm specially interested in feedback for exception handling (throw, catch).
...
|
|
In the GT (Graph Transformer) model presented by Dwivedi & Bresson in "A Generalization of Transformer Networks to Graphs", the following equations are used to update node and edge ...
|
|
I encountered this problem when studying Uwe Schoning's Logic for Computer Scientists. At the moment, I simply don't seem to think the statement makes sense.
What I've tried is to suppose that it is ...
|
|
I am experimenting with LL(1) parsers that do not use a separate lexer.
I have the following grammar:
S = (('<' S '>' | 'a'+) ' '?)+
The notation uses ' ...
|
Greatest hits from previous weeks:
|
|
What is the difference between minimum spanning tree algorithm and a shortest path algorithm?
In my data structures class we covered two minimum spanning tree algorithms (Prim's and Kruskal's) and ...
|
|
Why do we use other bases which are neither binary (for computers) nor decimals (for humans)?
Computers end up representing them in binary, and humans strongly prefer getting their decimal ...
|
|
If you calculate the area of a rectangle, you just multiply the height and the width and get back the unit squared.
Example:
5cm * 10cm = 50cm²
In contrast, if you calculate the size of an image, you ...
|
|
I've always wondered why processors stopped at 32 registers. It's by far the fastest piece of the machine, why not just make bigger processors with more registers? Wouldn't that mean less going to the ...
|
|
From what I have seen about usage of a pair of public and private keys, the public key is used for encrypting a message, and the private key is used for decrypting the encrypted message.
If a message ...
|
|
I often hear people talking about parallel computing and distributed computing, but I'm under the impression that there is no clear boundary between the 2, and people tend to confuse that pretty ...
|
|
When using A* (or any other best path finding algorithm), we say that the heuristic used should be admissible, that is, it should never overestimate the actual solution path's length (or moves).
How ...
|
Can you answer these questions?
|
|
A simple graph is a minimal graph with radius and diameter of 2 if its radius and diameter are 2, and removing any edge would increase its diameter. The question is how many such unlabelled graphs on $...
|
|
We are given a Graph, G(V, E), where V is the node set and E is the edge set consisting of ordered tuples (u, v). The graph is undirected, as such, if (u,v) is in E, then (v, u) is in E.
Alongside the ...
|
|
I'm working on an algorithm that, in a certain stage, requires solving a variation of the graph coloring problem. (The vertices are line segments in a plane, and two vertices are connected iff the ...
|
