Martin Thoma
Martin Thoma. Martin Thoma...
Read Martin-thoma.com news digest here: view the latest Martin Thoma articles and content updates right away or get to their most visited pages. Martin-thoma.com belongs to a large group of moderately popular websites, with around 59K visitors from all over the world monthly. It seems that Martin Thoma content is notably popular in USA, as 5.5% of all users (3.3K visits per month) come from this country. We haven’t detected security issues or inappropriate content on Martin-thoma.com and thus you can safely use it. Martin-thoma.com is hosted with CloudFlare, Inc. (United States) and its basic language is English.
Content verdict: Safe
Website availability: Live
Language: English
Last check:
-
1 976
Visitors daily -
1 976
Pageviews daily -
2
Google PR -
721 635
Alexa rank
Best pages on Martin-thoma.com
-
Lasagne for Python Newbies · Martin Thoma
Lasagne is a Python package for training neural networks. The nice thing about Lasagne is that it is possible to write Python code and execute the training on nVidea GPUs with automatically generated ...
-
Permutationen und Transpositionen · Martin Thoma
Permutation Definition Es sei M eine endliche Menge. Eine bijektive Selbstabbildung von M heißt Permutation. Die Menge $S_M$ der Permutationen von M ist eine Gruppe bezüglich der Verkettung $\circ$ vo...
-
Martin Thoma Printers are annoying and expensive. I have a broken laser printer and a half-broken ink printer. I'm thinking about buying a thermal printer. Before I buy something new, I typically do a...
Martin-thoma.com news digest
-
10 years
How to check if a point is inside of a polygon?
Suppose you have a with \(n\) sides. This is called a \(n\)-glon.
Basics about polygones
A \(n\)-glon can be defined by a list of \(n\) points. -
10 years
The Word Error Rate (short: WER) is a way to measure performance of an ASR. It compares a reference to an hypophysis and is defined like this:
\(\mathit{WER} = \frac{S+D+I}{N}\)
where -
10 years
In Python, you can use the following ways to format Strings:
Print directly
Printing them directly (just like printf in C): -
11 years
Fibonacci, recursion and decorators
I think everybody who learned something about recursion has seen the Fibonacci sequence:
\(
f(n) := \begin{cases}
Domain history
| Web host: | CloudFlare, Inc. |
| Registrar: | NameCheap, Inc. |
| Registrant: | Redacted for Privacy (Privacy service provided by Withheld for Privacy ehf) |
| Updated: | August 23, 2024 |
| Expires: | September 21, 2026 |
| Created: | September 21, 2011 |
Whois record
Visitor gender
Male
Female
Safety scores
Trustworthiness
N/AChild safety
N/A
