CTzatzakis

Chris Tzatzakis's repositories

Computational-physics

:notebook: Simulation exercises access point for result extraction which can be used in modeling and theoretical approach of molecular and atomic processes.

Language:C++GPL-3.0100

Wordlists

:page_facing_up: A sample set of word lists / dictionaries for testing against a dictionary attack

100

Algorithms

Data structure algorithmic library

Language:CGPL-3.0000

C_plus_plus_basics

:paw_prints: Tutorial Coding for C++ - Stuff beginers need to know

Language:C++GPL-3.0000

Chromium-49-Windows-XP

Chromium build 49.0.2623.23 archived repo ready to use / build for older Windows XP systems

Language:Python010

computational-processes

repository of computational processes

Language:C++010

Damerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other.

Language:C++000

js-Scene-Wave-Snow-Mountains

A scene created using JavaScript css and html. Waves - Snow - Mountains

Language:JavaScriptGPL-3.0010

k-means-clustering

k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster.

Language:C++GPL-3.0010