Question Detail: Per recommendation I am reposting this from Stack Overflow. Recently I have been thinking about following issue. Consider the code for a standard “Hello world!” program: main() { printf(“Hello World”); } Now almost any change in this code will Read More …
Author: ignougroup
Show how to do FFT by hand
Question Detail: Say you have two polynomials: $3 + x$ and $2x^2 + 2$. I’m trying to understand how FFT helps us multiply these two polynomials. However, I can’t find any worked out examples. Can someone show me how FFT algorithm Read More …
Maximum Independent Set of a Bipartite Graph
Question Detail: I’m trying to find the Maximum Independent Set of a Biparite Graph. I found the following in some notes “May 13, 1998 – University of Washington – CSE 521 – Applications of network flow”: Problem: Given a bipartite graph Read More …
How to understand the reduction from 3-Coloring problem to general $k$-Coloring problem?
Question Detail: 3-Coloring problem can be proved NP-Complete making use of the reduction from 3SAT Graph Coloring (from 3SAT). As a consequence, 4-Coloring problem is NP-Complete using the reduction from 3-Coloring: Reduction from 3-Coloring instance: adding an extra vertex to the Read More …
Quicksort vs. insertion sort on linked list: performance
Question Detail: I have written a program to sort Linked Lists and I noticed that my insertion sort works much better than my quicksort algorithm. Does anyone have any idea why this is? Insertion sort has a complexity of $Theta(n^2)$ and Read More …
How does the momentum term for backpropagation algorithm work?
Question Detail: When updating the weights of a neural network using the backpropagation algorithm with a momentum term, should the learning rate be applied to the momentum term as well? Most of the information I could find about using momentum have Read More …
Call by value-result vs. call by reference?
Question Detail: From my Googling, it appears that call by value-result is similar to call by reference in that it changes values in the caller, but it’s different in that the changes don’t take place until the callee exits, and that Read More …
Call by value-result vs. call by reference?
Question Detail: From my Googling, it appears that call by value-result is similar to call by reference in that it changes values in the caller, but it’s different in that the changes don’t take place until the callee exits, and that Read More …
How does the momentum term for backpropagation algorithm work?
Question Detail: When updating the weights of a neural network using the backpropagation algorithm with a momentum term, should the learning rate be applied to the momentum term as well? Most of the information I could find about using momentum have Read More …
Quicksort vs. insertion sort on linked list: performance
Question Detail: I have written a program to sort Linked Lists and I noticed that my insertion sort works much better than my quicksort algorithm. Does anyone have any idea why this is? Insertion sort has a complexity of $Theta(n^2)$ and Read More …
