Problem Detail: Why are neural networks initial weights initialized as random numbers? I had read somewhere that this is done to “break the symmetry” and this makes the neural network learn faster. How does breaking the symmetry make it learn faster? Read More …
Author: ignougroup
[Solved]: Is there a computationally reasonable algorithm for generating a set of polygons from a set of 2d points?
Problem Detail: Is there a known/existing algorithm for taking a 2D canvas covered in arbitrarily/randomly distributed points and dividing it entirely into a set of non-overlapping polygons? An example of the kind of result I’m looking for: Asked By : CaptainRad Answered Read More …
[Solved]: Is single-source single-destination shortest path problem easier than its single-source all-destination counterpart?
Problem Detail: Dijkstra’s algorithm (wiki) and Bellman-Ford (wiki) algorithm are two typical algorithms for the single-source shortest path problem. Both of them compute distances for all nodes from source $s$. If both source $s$ and destination $t$ are fixed, can we Read More …
[Solved]: detect closed shapes formed by points
Problem Detail: I plot several arrays containing xy-coordinates of points (using plot(x,y)) and obtain a plot with some curves. The curves form some very distinctive closed shapes (that is, the points describing the curves lie close to each other). Now I Read More …
[Solved]: Does every problem in NP have an exponential time algorithm?
Problem Detail: I am not sure that every problem in NP have an exponential time algorithm. Since NP does not mean “not polynomial.”, I think the answer is false. But I have no concrete reason about that. Asked By : Jung-Hyun Answered Read More …
[Solved]: How to prove the structured program theorem?
Problem Detail: Wikipedia: The structured program theorem […] states that […] any algorithm can be expressed using only three control structures. They are Executing one subprogram, and then another subprogram (sequence) Executing one of two subprograms according to the value of Read More …
[Solved]: Why does the Count-Min Sketch require pairwise independent hash functions?
Problem Detail: The Count-Min Sketch is an awesome data structure for estimating the frequencies of different elements in a data stream. Intuitively, it works by picking a variety of hash functions, hashing each element with those hash functions, and incrementing the Read More …
[Solved]: Kruskal’s and Prim’s algorithm
Problem Detail: Does Kruskal’s and Prim’s algorithm work on directed graphs? I want the two algorithms to find a minimum spanning tree. For further enlightenment, I would like to know what other problems Kruskal’s and Prim’s can solve. So far, I Read More …
[Solved]: Characterisation of graphs that are not 3-colorable
Problem Detail: We know that all graphs with odd cycles (odd number of vertices) are not 2-colorable. Is there a similar characterisation for 3-colorability? I am looking for undirected graphs that are not 3-colorable depending on a single graph property e.g. Read More …
[Solved]: Starvation in longest remaining time first CPU scheduling
Problem Detail: I want to know if longest remaining time first (LRTF) CPU scheduling has starvation or not. Also give reason how it starve/does not starve a process. I know longest job first (LJF) may starve a process if all other Read More …
