User Subhayan

21 votes

Accepted

What is the significance of negative weight edges in a graph?

answered Sep 11, 2013 at 1:55

8 votes

compressed information = randomness?

answered Oct 3, 2013 at 15:56

7 votes

Accepted

High maths for game theory

answered Sep 15, 2013 at 12:10

6 votes

Accepted

Why are weights of Neural Networks initialized with random numbers?

answered Aug 23, 2013 at 4:01

6 votes

How does facial recognition work?

answered Sep 2, 2013 at 10:59

5 votes

How do computers create 'randomness'?

answered Aug 24, 2013 at 8:18

5 votes

Prove correctness of recursive Fibonacci algorithm, using proof by induction

answered Aug 31, 2013 at 8:08

5 votes

Decide if L is regular or not and argue it. Trying to use Pumping Lemma

answered Sep 7, 2013 at 2:00

5 votes

Why is discrete mathematics required for data structures?

answered Sep 19, 2013 at 22:12

5 votes

What is "dynamic" about dynamic programming?

answered Nov 10, 2013 at 9:45

4 votes

String inputs in Machine Learning

answered Sep 21, 2013 at 6:52

4 votes

What is the trade off in converting a DFA into a NFA?

answered Sep 3, 2013 at 12:34

3 votes

Which classifier is more accurate for a SVM classification?

answered Sep 22, 2013 at 9:59

3 votes

Accepted

Determine whether two languages are context free

answered Sep 22, 2013 at 23:09

3 votes

What is the asymptotic runtime of this nested loop?

answered Oct 7, 2013 at 13:29

3 votes

Accepted

Regular Expression as basis for creating this grammar

answered Oct 6, 2013 at 3:47

2 votes

Accepted

Finding Statistical Signifigance for a Classifier

answered Oct 7, 2013 at 0:06

2 votes

Accepted

Ternary Search Recurrence Relation

answered Oct 7, 2013 at 1:30

2 votes

Computational complexity lecture/videos/exercise

answered Nov 19, 2013 at 14:26

2 votes

kNN: how to improve Spam classification?

answered Mar 27, 2014 at 17:36

2 votes

Converting NFA to DFA

answered Sep 20, 2013 at 3:24

2 votes

Why does stable matching without Gale-Shapely takes n! steps

answered Sep 4, 2013 at 4:40

2 votes

Accepted

Probability that a uniformly random sequence is already sorted

answered Sep 8, 2013 at 10:06

1 vote

How do I prove that Context Free languages have more memory than FSM

answered Sep 9, 2013 at 9:54

1 vote

What exactly can finite-state machines not do?

answered Sep 3, 2013 at 12:05

1 vote

Class of a Language

answered Sep 19, 2013 at 2:41

1 vote

How many recursive calls are made by this gcd function?

answered Aug 19, 2013 at 12:42

1 vote

Accepted

Can a Turing Machine decide only non-regular languages?

answered Nov 7, 2013 at 2:12

0 votes

Appropriate minor to go with CS major

answered Feb 12, 2014 at 4:08

0 votes

What does the language {a, b, c}* exactly mean? How will the automaton for this look like?

answered Mar 9, 2015 at 13:49

Stack Exchange Network

32 Answers

What is the significance of negative weight edges in a graph?

compressed information = randomness?

High maths for game theory

Why are weights of Neural Networks initialized with random numbers?

How does facial recognition work?

How do computers create 'randomness'?

Prove correctness of recursive Fibonacci algorithm, using proof by induction

Decide if L is regular or not and argue it. Trying to use Pumping Lemma

Why is discrete mathematics required for data structures?

What is "dynamic" about dynamic programming?

String inputs in Machine Learning

What is the trade off in converting a DFA into a NFA?

Which classifier is more accurate for a SVM classification?

Determine whether two languages are context free

What is the asymptotic runtime of this nested loop?

Regular Expression as basis for creating this grammar

Finding Statistical Signifigance for a Classifier

Ternary Search Recurrence Relation

Computational complexity lecture/videos/exercise

kNN: how to improve Spam classification?

Converting NFA to DFA

Why does stable matching without Gale-Shapely takes n! steps

Probability that a uniformly random sequence is already sorted

How do I prove that Context Free languages have more memory than FSM

What exactly can finite-state machines not do?

Class of a Language

How many recursive calls are made by this gcd function?

Can a Turing Machine decide only non-regular languages?

Appropriate minor to go with CS major

What does the language {a, b, c}* exactly mean? How will the automaton for this look like?