Reputation
Top tag
Next privilege 100 Rep.
Edit community wikis
Badges
7
Newest
 Teacher
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 6 votes cast
Jul
2
accepted number of combinations of ordered sequences of N integers
Jul
2
asked number of combinations of ordered sequences of N integers
May
15
revised derivation of divergence from nabla operator
deleted 20 characters in body
May
15
revised derivation of divergence from nabla operator
deleted 8 characters in body
May
15
asked derivation of divergence from nabla operator
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
added 179 characters in body; edited title
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
edited title
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
edited title
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
added 3 characters in body
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
added 61 characters in body
Aug
31
comment Expected distance traversed between 2 vertices on probabilistic graph
why "-1" to the question?
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
added 4 characters in body
Aug
31
revised Expected distance traversed between 2 vertices on probabilistic graph
added 3 characters in body
Aug
31
asked Expected distance traversed between 2 vertices on probabilistic graph
Jun
23
awarded  Teacher
Oct
12
awarded  Tumbleweed
Oct
5
revised Global optimum of sum of convex functions
added 7 characters in body
Oct
5
asked Global optimum of sum of convex functions
Oct
5
answered Global optimization problem, whats a good approach? Branch and bound method?
Oct
5
comment Building a graph from pairwise distances
Cris, I'm sorry, but I don't understand your point. Since I wrote that $d$ is a metric in mathematical sense, it will always be finite. In other words, I can always construct a graph by combining all vertices. Hence, the problem has always a solution.