User Aaron

14 votes

Accepted

When are binary trees better than hashtables in real world applications?

answered Sep 27, 2014 at 22:05

4 votes

Accepted

Training and testing image sizes for classification in computer vision

answered May 14, 2014 at 3:34

4 votes

Support Vector Machines as Neural Nets?

answered Sep 25, 2014 at 22:55

2 votes

Source Coding Theorem: what happen when go below N⋅H(x) bits?

answered Sep 26, 2014 at 3:25

2 votes

Application of cosine similarity to detect plagiarism

answered Oct 3, 2014 at 3:40

2 votes

Neural Network Normalization and de-Normalisation of data

answered Dec 29, 2013 at 21:11

2 votes

Accepted

How feasible is it for a non-distributed web crawler running on consumer hardware to search the internet?

answered Jan 22, 2014 at 20:47

2 votes

Segmenting an English string with no spaces using dynamic programming

answered Oct 4, 2014 at 17:35

1 vote

Accepted

How can I analyze the time complexity of this Dynamic Time Warping algorithm implemented in MATLAB?

answered Dec 8, 2013 at 7:54

0 votes

Accepted

Doesn't post-order traversal require subtrees to be evaluated separately?

answered Dec 14, 2013 at 18:29

0 votes

Does 2-edge-colourability imply 2-colourability?

answered Oct 3, 2014 at 4:56

0 votes

How do I calculate values in K-means (clustering)?

answered May 3, 2016 at 4:43

Stack Exchange Network

12 Answers

When are binary trees better than hashtables in real world applications?

Training and testing image sizes for classification in computer vision

Support Vector Machines as Neural Nets?

Source Coding Theorem: what happen when go below N⋅H(x) bits?

Application of cosine similarity to detect plagiarism

Neural Network Normalization and de-Normalisation of data

How feasible is it for a non-distributed web crawler running on consumer hardware to search the internet?

Segmenting an English string with no spaces using dynamic programming

How can I analyze the time complexity of this Dynamic Time Warping algorithm implemented in MATLAB?

Doesn't post-order traversal require subtrees to be evaluated separately?

Does 2-edge-colourability imply 2-colourability?

How do I calculate values in K-means (clustering)?