Top new questions this week:
|
|
Git uses SHA hashing as a content address key. This relies on their being a vanishingly small probability that two different pieces of content will ever hash to the same key.
For content ...
|
|
Brief: I have two configurations, a and b, of the same set of Rummikub tiles (a may not be a ...
|
|
Here is the block diagram of the pipeline for the H.264 encoder (Fundamentals of Multimedia by Ze-Nian Li, Mark S. Drew and Jiangchuan Liu).
The feedback loop is used for motion estimation, but why ...
|
|
I have a parameter $q$ which is the probability of selecting a vertex (among $n$ vertices...) to be in a certain set.
I am constructing the sets in an iterative way, having the vertex $v_i$ be in the ...
|
|
In a simple weighted graph, with n vertices and m edges , for each pair of vertices we want to find the number of edges that appeared at least in one of the shortest paths between these two vertices.
...
|
|
The way I understand is that complexity classes which are denoted with $\Sigma_i$ are representing a combination of alternating variable quantifiers which must start with an existential quantifier $\...
|
|
I've come up with a greedy algorithm proof for the minimum denominations problem, and I'm curious if someone can verify the correctness of the proof for me. I have simplified the problem by ...
|
Greatest hits from previous weeks:
|
|
If you use min() or max() on a constant sized list, even in a loop, is the time complexity O(1)?
|
|
Many computer science programs require two or three calculus classes.
I'm wondering, how and when is calculus used in computer science? The CS content of a degree in computer science tends to focus ...
|
|
I'm trying to solve the recurrence $$T(n)=2T(\sqrt{n})+\log n$$ using the master theorem. Which case applies here?
|
|
Randomized Quick Sort is an extension of Quick Sort in which the pivot element is chosen randomly. What can be the worst case time complexity of this algorithm. According to me, it should be $O(n^2)$, ...
|
|
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 ...
|
|
I have a greedy algorithm that I suspect might be correct, but I'm not sure. How do I check whether it is correct? What are the techniques to use for proving a greedy algorithm correct? Are there ...
|
|
If I have a list of key values from 1 to 100 and I want to organize them in an array of 11 buckets, I've been taught to form a mod function
$$ H = k \bmod \ 11$$
Now all the values will be placed ...
|
Can you answer these questions?
|
|
I am designing a simple algorithm to be used at hardware level. And I want to find its time complexity.
i=1
while(i<=n)
{
i=i*2;
}
How I'd go about finding ...
|
|
So my question is about when we want to find the total derivative of the NLL Loss function $L$ w.r.t. $w_i$.
So the "pipeline" is often expressed as:
$$\frac{\partial L}{\partial w_i} = \...
|
|
I read that one assumption for Successive Shortest Paths algorithm for computing the minimum cost flow problem is that every cost is non-negative.
I also read that this assumption can be removed with ...
|
