addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupsimageimagesinstagramlinklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1outlookpersonJoin Group on CardStartprice-ribbonShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahoo

R vs. Julia

  • Apr 18, 2012 · 6:30 PM
  • This location is shown only to members

Thanks to Yeng, we have a meeting at Zillow this month.  I am working on a brief intro and comparison between R and Julia, a relatively new language that is gaining a lot of traction in the statistical computing community.  If you are also interested in presenting, let me know and we can work together on this.

 

Key details:

·        We can accommodate 60+ guests.

·        We’ll setup the projector with a laptop.

·        We’ll provide food.

.        We'll provide vouchers for your cars parking in the Rusell Center garage valid from the evening starting at 5PM.


Join or login to comment.

  • Alex Z.

    @Tommy: when n large, fib(n) ~ exp(a*n), so fib.fast(10000)= Inf.
    If we do not want to use explicit equation for fib(), we could rewrite your algo, using La= log(a), and so on. Then


    fib.fastL <- compiler::cmpfun( function(n) { La=0; Lb=0; for(i in seq_len(n)) { Lc=La+log(1+exp(Lb-La));
    La=Lb; Lb=Lc }; Lb } );
    system.time(x<- fib.fastL(10000)) # 0.0s
    x # user system elapsed
    # 0.02 0.00 0.02
    # [1] 4812

    April 29, 2012

  • Tommy F.

    Great meeting, thanks a lot!

    I have no doubt Julia will be a fast & useful language at some point. We'll just have to see if it gains popularity or not.


    Couldn't resist posting faster fibonacci R code though ;-)

    fib.rec <- compiler::cmpfun( function(n) if (n > 1) Recall(n-1) + Recall(n-2) else n )

    system.time(fib.rec(30)) # 2.74s

    fib.fast <- compiler::cmpfun( function(n) { a=1; b=0; for(i in seq_len(n)) { c=a+b; a=b; b=c }; b } )

    system.time(fib.fast(10000)) # 0.0s

    1 · April 19, 2012

  • Berkeley C. M.

    Sorry for the crappy formatting. :)

    April 18, 2012

  • Berkeley C. M.

    Yes, thanks for the great talk and hospitality.

    For those interested in the "why" of Julia, check this out:
    http://julialang.org/blog/2012/02/why-we-created-julia/

    Also, here's the MS talk I mentioned to a few of you:
    http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Julia

    Finally, builds of Julia to play with (incl. Windows):
    https://github.com/downloads/JuliaLang/julia/julia-package.zip

    Looking forward to future meetings.

    @berkeleymalagon

    April 18, 2012

  • Alex Z.

    Thanks Zach and Zillowers,
    Very interesting!

    April 18, 2012

  • John G.

    Thanks Zach & Yeng (and Zillow). Great meeting!

    April 18, 2012

35 went

Our Sponsors

  • Level

    Hosting August meetup

  • Microsoft

    Providing funding support and occasional meeting venues

  • Bioconductor

    Providing a meeting venue

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy