peterderivaz

9 ms·

1.
by peterderivaz 3mo ago
I've been trying out this model on a 4090 to transcribe a Japanese grammar pdf (written in English with lots of Japanese examples) and it seems to be working very well from the small parts I have double checked. The output contains bo
2.
"Populous: The Beginning" frame breakdown(github.com)
5 points by peterderivaz 4mo ago|2 comments
3.
by peterderivaz 4mo ago
Reverse engineering the graphics from the 1998 3D Populous game.
4.
by peterderivaz 8mo ago
The Raspberry Pi contains a Videocore processor (I wrote the original instruction set coding and assembler and simulator for this processor). This is a general purpose processor which includes 16 way SIMD instructions that can access data i
5.
by peterderivaz 3y ago
Project Euler challenge involving Fractran: https://projecteuler.net/problem=308
6.
The Art of Snakebird (3d graphics for 2d game)(noumenongames.com)
1 points by peterderivaz 10y ago|0 comments
7.
by peterderivaz 10y ago
In practice I would expect Knuth's DLX algorithm to be much faster, both for generating the first solution, and for counting all solutions (for any reasonable sized N). There are some timing results for a (well-optimized) backtracking
8.
by peterderivaz 10y ago
We paid a company called Metaware to make a compiler. I believe this compiler is still in use. As it happens, while we were waiting for this compiler to be made for us, I ported GCC to the architecture for my own use. I don't remembe
9.
by peterderivaz 10y ago
It was my first job out of University to design this instruction set which may explain some of the quirkiness... Initially the instructions did all set the status flags but it caused a tight feedback loop in the processor. The choice was be
10.
by peterderivaz 11y ago
Not the original poster, but one thing that confused me was that I can clearly draw a graph that cannot be two coloured with a single pen stroke if I am allowed to reverse direction and keep drawing back over the same line again (indeed it
11.
by peterderivaz 11y ago
I've found using nolearn and lasagne on top of Theano made Theano much easier to use while still being in Python with access to familiar graphics routines. lasagne gives you ways of constructing neural network layers (implemented as Th
12.
by peterderivaz 11y ago
I think in this formula the altitude should be in feet, while the result is in miles, so 30,000 feet actually gives 213 miles.
13.
by peterderivaz 11y ago
I ran some experiments to investigate the discrepancy. The largest differences were caused by: 1. A variable quantiser being used for HEVC, but not for VP9 (as you described) 2. Keyframes being forced every 30 frames for VP9 in the first pa
14.
by peterderivaz 12y ago
I don't know Colin's logic, but my personal reasoning would be: 1. If this were true then it gives a simple, efficient, deterministic method to test for primes. (You can compute P_n modulo n efficiently using matrix exponentiatio
15.
by peterderivaz 12y ago
The list is here: http://oeis.org/A013998 The first is P_(271441) with 33,150 digits
16.
by peterderivaz 12y ago
I ran into this when computing PSNR comparisons using a Numpy function that returned a numpy integer type: >>> import numpy >>> x=0 >>> y=numpy.int32(2*10**9) >>> x+=y >>> x
17.
by peterderivaz 12y ago
Another similar idea is the Kempner series. If you add 1/n for all natural numbers n, then the series tends towards infinity. However, if you leave out any integers that contain a digit 9, then the series converges (to just under 23).
18.
Measure typing speed (ignores spelling mistakes)(penguinspuzzle.appspot.com)
1 points by peterderivaz 12y ago|1 comments
19.
by peterderivaz 12y ago
I enjoyed this blog post and Javascript implementation of an interactive Quantum circuit inspector. http://strilanc.com/quantum/2014/03/07/Building-your-own-Qua... It is a lower level than the Google pro
20.
by peterderivaz 13y ago
The vector register file is a block of registers 64 bytes across by 64 down which can be accessed horizontally (H) or vertically (V), and in units of 16 bytes (H8), 16 shorts (H16 or HX), or 16 32-bit words (H32). Each processor has an accu
21.
by peterderivaz 13y ago
I wonder if you misunderstood his comment as a suggested method to solve the mathematical problem? The way I read it, he was suggesting a possible way of reducing the size of the DRUP certificate from 13GByte by searching for common pattern
22.
Spelunky Procedural Level Generation (tinysubversions.com)
71 points by peterderivaz 13y ago|13 comments
23.
by peterderivaz 13y ago
I've been using Anki for learning Japanese. I've particularly appreciated the decks that include audio of complete sentences and have found that it has greatly improved my ability to understand spoken language. One thing that I&#
24.
by peterderivaz 13y ago
Have you seen crazybump? There is a good tutorial on it at http://www.blenderguru.com/videos/the-secrets-of-realistic-t... It is a program that takes a single image and generates diffuse/normal/occlusion&#x2F
25.
by peterderivaz 13y ago
Interestingly, Wikipedia disagrees. For a radix of 10, there is thought to be no number with a multiplicative persistence > 11: this is known to be true for numbers up to 10 to the power of 50. http://en.wikipedia.org/wik
26.
by peterderivaz 13y ago
You could try my charityware WebGL game at http://www.penguinspuzzle.appspot.com/
27.
by peterderivaz 14y ago
I guess you could find the shortest path by iteratively deleting an edge and checking whether the best cost has got worse. If it does get worse, then put that edge back in and try deleting another edge. If it does not get worse, then perm
28.
by peterderivaz 14y ago
I've posted a Python version of the main max clique algorithm at https://github.com/peterderivaz/maxclique This implements the algorithm as I understood it described in the paper. A small implementation detail that might accelerate things
29.
Show HN: WebGL 3d penguin puzzle game(penguinspuzzle.appspot.com)
3 points by peterderivaz 14y ago|1 comments
30.
by peterderivaz 14y ago
As far as I understand, the basic idea is to cooperate with a probability that depends on whether your opponent cooperated in the previous round. (Actually there are 4 probabilities because the strategy also depends on whether you cooperat

More ›