Blog

As you probably already now, recursive function are those that call them self. For instance, you can define the factorial function as: fact(0) = 1 fact(n) = n*fact(n-1) This doesn't look like something you can say with the small syntaxis of the λ-calculus...

Today we had the orientation presentation for an Internship that two students from Trinity College will be doing around Riff/RNA. They will be helping us build some classification tools involving machine learning with SVM's and Bayesian classifiers...

You can register for the event here. Thanks Miguel for this opportunity. Event details (spanish): Towebs & MSDN lo invitan a conocer las herramientas más innovadoras para el desarrollo web en plataforma Windows. Las charlas...

I know I promised a mini DEVS model for this post. But I bumped into this interesting thing and I wanted to share it. We are currently working on a JSF web application which has a GWT component in it. To debug the app, we have to compile the GWT component...

The goal is to generate 3D trees programatically rather than using a design tool. A tree is a complex model, containing thousand of vertices, which are both hard to create and inneficient to store. By saving just the information necessary to generate...