concancon

concancon

Geek Repo

Location:Berlin, Germany

Github PK Tool:Github PK Tool

concancon's repositories

cellularUtil

Parse and resize a cellular automata lib that is referenced on wikipidia

Language:MaxStargazers:1Issues:1Issues:0

DX7

Dx7 Implementation in Max/Msp based on the tutorial series from Really Useful Plugins

Language:MaxStargazers:1Issues:2Issues:0

euclidean

A simple euclidean rhythm generator external for Max

Language:CLicense:MITStargazers:1Issues:2Issues:0

genetic

A Max/Msp object to find a parameter set based on the genetic algorithm developed with the min sdk

Language:MaxStargazers:1Issues:3Issues:0

Markov-midi

prototype for a markov midi processing system written in Max Msp and Javascript

Language:MaxStargazers:1Issues:2Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:JavaScriptStargazers:0Issues:2Issues:0
Language:TypeScriptStargazers:0Issues:0Issues:0
Language:TypeScriptStargazers:0Issues:0Issues:0

CellularAutomata

a cellular automata sequencer for rhythm generation

Language:JavaScriptStargazers:0Issues:1Issues:0

collinear

Computer vision involves analyzing patterns in visual images and reconstructing the real-world objects that produced them. The process is often broken up into two phases: feature detection and pattern recognition. Feature detection involves selecting important features of the image; pattern recognition involves discovering patterns in the features. We will investigate a particularly clean pattern recognition problem involving points and line segments. This kind of pattern recognition arises in many other applications such as statistical data analysis.

Language:JavaStargazers:0Issues:0Issues:0

ComponentBasedDevelopment

RESTful Java EE Webservice developed using pair programming with @noeljns

Language:JavaStargazers:0Issues:2Issues:0
Language:VueStargazers:0Issues:0Issues:0

Markov-N-order

higher order Markov Chains

Language:JavaScriptStargazers:0Issues:1Issues:0
Language:JavaScriptStargazers:0Issues:1Issues:0

Deque

Deque with the following performance requirements: The implementation must support each deque operation (including construction) in constant worst-case time. A deque containing n items must use at most 48n + 192 bytes of memory. Additionally, your iterator implementation must support each operation (including construction) in constant worst-case time.

Language:JavaStargazers:0Issues:0Issues:0

destructuring-performance-measurement

Compare the performance of destructuring inside a reduce loop

Language:JavaScriptLicense:MITStargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:2Issues:0

euclid_cpp

C++ version of euclidean~external developed with the min sdk

Language:MakefileStargazers:0Issues:2Issues:0

gen_rhythm

Modules for rhythmic ratcheting in gen

Language:MaxStargazers:0Issues:0Issues:0
Language:C++Stargazers:0Issues:2Issues:0
Language:MaxStargazers:0Issues:1Issues:0

mock

A mocked/stubbed library for linking unit tests of Max externals built with the Min-DevKit.

Language:C++Stargazers:0Issues:1Issues:0

OpenGL

Repository to explore learn OpenGL Tutorials

Language:C++Stargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:1Issues:0
Language:MaxStargazers:0Issues:0Issues:0
Language:MaxStargazers:0Issues:0Issues:0

simulations

a repository containing several module simulations

Language:MaxStargazers:0Issues:2Issues:0