Rank: 241254 based on 0 downloads (last 30 days) and 0 file submitted

none

E-mail: Contact Author

Personal Profile:
Professional Interests:

Watch this Author's files

Files
Watch Lists

Comments and Ratings by none		View all 1 - 5 of 20
Updated	File	Comments	Rating
15 Apr 2013	NumberFormatter Flexible number formatting using java. Author: Stephen Lienhard	nice
11 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm Author: Derek O'Connor	Derek, I sent you an email outlining the real problem data/context etc. I look forward to your reply!
08 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm Author: Derek O'Connor	My mistake! Yes I can see you have written it in. Excellent algo that works straight out of the box.
07 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm Author: Derek O'Connor	I try to run TestBFNOTMaps.m and get the error Error using load Unable to read file spusaNE: No such file or directory. where is this file? Not in the zip file.
25 Jan 2013	SLM - Shape Language Modeling Least squares spline modeling using shape primitives Author: John D'Errico

Currently Watching
Type	Description
Author	Edward Grace
File	Simulate a Hawkes process
File	Granger Causality Test
File	Forward Viterbi Algorithm
File	Empirical Mode Decomposition
File	The Bellman-Ford-Moore Shortest Path Algorithm

Files Matching none's Watch List					View all 1 - 5 of 7
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
18 Sep 2012		The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm Author: Derek O'Connor	shortest paths, sparse graphs	28	9	5.0 5.0 \| 1 rating
09 Aug 2010		Example of Volatility Pumping This script demonstrates the phenomenon of excess growth in a constant rebalancing portfolio. Author: Edward Grace	portfolio, crp, shannons demon, finance, rebalance	4	0
24 May 2010		GAFFE A toolbox for solving evolutionary nonlinear PDEs This toolbox implements the well known split-step Fourier technique for solving nonlinear PDEs. Author: Edward Grace	soliton, 2d, 1d, nd, pde, nonlinear	16	7	5.0 5.0 \| 3 ratings
18 Mar 2010		Granger Causality Test Conducts a Granger Causality test using the Bayesian Information Criterion to select lag length Author: Chandler	granger causality, time series analysis, statistics, granger causality tes..., finance, granger cause	60	5	3.0 3.0 \| 4 ratings
12 Jan 2010		Forward Viterbi Algorithm Forward Viterbi algorithm based on: http://en.wikipedia.org/wiki/Viterbi_algorithm Author: David Conger	viterbi algorithm, hidden markov model, dynamic programming	38	2	3.0 3.0 \| 3 ratings

Comments and Ratings Matching none's Watch List			1-5 of 28
Date	File	Comment by	Comments	Rating
08 May 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm	Roland	Dear Derek, Do I understand correctly when I say that your function is only capable of computing the shortest path between a root and all other nodes. I am looking for a function that efficiently computes shortest paths between all nodes in a subset of the nodes of the whole graph. Do I understand your code correctly when I say the following: - I would have to call the function multiple times (for each root). It is not possible to specify r as a vector of roots? In other words, this algorithm does not save any info when you have to compute path from multiple roots. - All computation spent on shortest paths to nodes that I do not need is lost. Is this really necessary (i.e. inherent to the Bellman-Ford algorithm) or could this could become faster if it is adapted to the situation I need it for? Thank you very much for your reply. Kind regards. Roland	Comment only
11 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm	none	Derek, I sent you an email outlining the real problem data/context etc. I look forward to your reply!	Comment only
08 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm	Derek O'Connor	@none Thanks for your compliments. I would be grateful if you would post or send me your results for these REAL problems. For example, I have not been able to find the official optimum solutions to the problems. This makes me uneasy.	Comment only
08 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm	none	My mistake! Yes I can see you have written it in. Excellent algo that works straight out of the box.	5
07 Mar 2013	The Bellman-Ford-Moore Shortest Path Algorithm A simple, efficient sparse implementation of the original Bellman-Ford-Moore Shortest Path Algorithm	Derek O'Connor	This file is not there because I did not have room for the larger files on my website. I pointed this out at the start of TestBFNOTMaps.m All the USA files are available here: http://www.dis.uniroma1.it/challenge9/download.shtml	Comment only