Saturday, March 24, 2012

ATVs are FUN!

Working with Bloom Filters

Bloom Filters. Implement a simple hash-based lookup mechanism and explore its characteristics.

Two items need to be resolved to optimally solve this:
1) Hash function which can uniquely map a good word, to a integer value within our bitfield.
2) Efficient allocation of bitfield, scalable to test how well the hash function performs with more or less memory.


Working with SVD-based Recommendation Engines

Working with Xcode

Working with NodeJS / Express

Working with Rails

Working with Sinatra