| CARVIEW |
-
Clojure client for Twitter APIForked from mattrepl/clojure-twitter Fri May 15 06:39:01 -0700 2009
-
A JSON encoder/parser for clojureForked from danlarkin/clojure-json Thu May 14 12:28:14 -0700 2009
-
Clojure code for the DC Clojure Study GroupUpdated Thu Mar 26 14:42:15 -0700 2009
Following
Public Activity
A JSON encoder/parser for clojure
Clojure client for Twitter API
access core functions on Android, iPhone and Blackberry using JavaScript
Web Application Framework in JavaScript and Objective-J
An open source, cross-platform, cross-language SDK for developing desktop apps using web technologies
Twitter reader
Tubes project demo
d0938893f327334de22611d887361ab03a0ab6b7
Completed build-tree function and duplicated results from python version; added a marco for timing a number of repeated executions
eb3068554c1397e44985d535d53b95739de6dbdf
teensy weentsy bit more
-
goodmike
committed
7f120e5e:
Still working on build-tree
-
goodmike
committed
c7051f6e:
Defined entropy-of-set
-
goodmike
committed
1303b1b5:
Added unique-counts function
-
goodmike
committed
722e5193:
Implemented divide-set for row record separation
-
goodmike
committed
3b0ca01f:
Getting started on decision tree learning example
7f120e5e27fbc063b3c93911b0afcb3788f2f0e8
Still working on build-tree
c7051f6e310489fb9440469f38811c11b8c3c57e
Defined entropy-of-set
1303b1b54d5ca8c8799de9cb04ce56814af24a18
Added unique-counts function
722e5193f7d74f6c7c082c3d52b169fec0429d9b
Implemented divide-set for row record separation
3b0ca01f59542f53380e5512f5ef4413a38b227a
Getting started on decision tree learning example
1c9ddfab5f80beaec41c62864437a14858f890ba
Updated minimal path sum to use a coordinated single-threaded approach
Scheme in as little Ruby and as much Scheme as possible. Supports macros, continuations, tail recursion and lazy evaluation.
b50058e650952be210e07e37db25feebc68e26e4
Improved on naive matrix path calculator with one that calculates and remembers the lowest path-sum to each cell and compares its path-sum as it goes to the lowest, terminating if its path-sum isn't lower. This changes the theta-n rate of growth from exponential to n*log n. Samples included in code.
5c8fcf3117f282ba25d9de771cec186ea5f0f36a
Commented out inefficient procedure: working towards efficient one.
8a47444ec9cc64e815e0625857d4f87654e4d689
Added beginning minimal path file
f131f553dfc59af3bfa459ec5c8d04ff8f5f7668
Added dining philosophers code from Jan 31 meeting.
