Home
taylortree 's Library tagged → View Popular
13 Sep 07
ONLamp.com -- An Introduction to Erlang
-
Great intro into the Erlang programming language.
- taylortree on 2007-09-13
10 Sep 07
Software Carpentry
-
Nice breakdown of all the software development practices using Python, make, Cygwin, Subversion, sqlite, and Gnumeric.
- taylortree on 2007-09-09
06 Sep 07
quantmod: Quantitative Financial Modelling Framework
-
Offers R language modules to...
- calculate periodic returns
- retrieve historic quotes from Yahoo, Google, FRED
- there's even a tradeModel that looks interesting.
- and well documented.
- taylortree on 2007-09-06
04 Sep 07
Speed up R, Python, and MATLAB - Going Parallel
-
Reduce runtime of Python, R, and MATLAB applications by 85%? Process 10-100X larger datasets? With just a few code changes? Not quite sure how...but something to explore in the future. Their success story on speeding up MATLAB code for Monte Carlo Analysis looks pretty easy of a code change to me. Read their blog for further insights into HPC...
- taylortree on 2007-09-04
03 Sep 07
Google Mondrian: web-based code review and storage
-
Online code review that works like a blog/wiki. I wonder...is it possible to create a code review system similar to Mondrian within a source management toolset such as subversion? Seems like most of the backend is there already...would only need to add some front end tools to display the changes being committed and allow comments on those changes.
- taylortree on 2007-09-03
Finding Duplicate Elements in an Array :: Phil! Gregory
-
Interesting way to find duplicates in an array. Enjoyed the links on the pigeonhold principle and Floyd's cycle-finding algorithm.
- taylortree on 2007-09-03
-
Now, suppose that the array is of length n and only contains positive
integers less than n. We can be sure (by the pigeonhole principle)
that there is at least one duplicate. -
So, how do we find the beginning of the cycle? The easiest approach is to
use Floyd's cycle-finding algorithm. It works roughly like this:
Start at the beginning of the sequence. Keep track of two values (call
them ai and aj). At
each step of the algorithm, move ai one step
along the sequence, but move aj two steps. Stop
when ai = aj.
1 - 9 of 9
Showing 20▼ items per page
Sponsored Links
Ads by Google
Top Contributors
Groups interested in programm...
Related Lists on Diigo
-
Rspec Intro
RSpec is a Behaviour Driven...
Items: 11 | Visits: 234
Created by: Vincent Tsao
-
webdevelopment
Links to webdevelopment
Items: 252 | Visits: 188
Created by: alfred westerveld
-
Programming jQquery
Items: 26 | Visits: 253
Created by: Vincent Tsao
Highlighter, Sticky notes, Tagging, Groups and Network: integrated suite dramatically boosting research productivity. Learn more »
Join Diigo
- taylortree on 2007-09-14