← Înapoi la Urmăritori

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 15
  1. Pratt Parsing

    Pratt Parsing I recently stumbled into a Pratt parsing based parser at work.

  2. Configuring Treesitter with precomiled grammars on windows If you are using treesitter on windows, it can be a bit of work to configure everything in order to compile grammars on your own.

  3. First off we must install Hunspell on the machine and expose it via exec-path: winget install hunspell After restarting powershell this is handy for getting the exec path: Get-Command hunspell | select -ExpandProperty Source | Split-Path | clip Insert in…

  4. Forget about LLMs or even Markov Chains, sometimes correct grammar is all you need for perfectly correct gibberish: I'm happy to annnounce my translation of the stochastic report generator(stokastiske rapportgenerator).

  5. Use C# in Emacs 29.1 The internet is full of C# on Emacs guides that are basically outdated now that emacs includes csharp-mode and eglot out of the gate.

  6. As you probably know, we now have an aperiodic monotile!

  7. Consider the following pseudo-code: f = 8 f = 4*x What is x?

  8. Riddles

    Riddles Here are some riddles, I didn't come up with them but I don't know the original authors.

  9. Intensity

    Intensities are extremely useful in the insurance industry.

  10. Snell's law tells us how a monochromatic light travels through a boundary between two different materials: \( n_1\sin\alpha=n_2\sin\beta\) The \( n_1,n_2\) values are constants determined by the respective materials.

  11. A lecture note with references on Locality sensitive hashing and MinHash.

  12. An annulus is a geometric object made up of two circles like this: The area of the annulus is clearly \( \pi R^2 - \pi r^2=\pi(R^2-r^2)\).

  13. Trapezoidal integration Say we want to approximate the definite integral \( \int_a^bf(x)dx\) 1 of some smooth function \( f: \mathbb{R}\rightarrow\mathbb{R}\).

  14. Thesis

    Similarity Problems in High Dimensions PhD Thesis, ITU, November 2017 Scalable learning through linearithmic time kernel approximation techniques Master Thesis, ITU, March 2014

  15. Publications

    The space complexity of inner product estimation Rasmus Pagh and Johan Sivertsen, ICDT 2020, Preprint Scalable and Robust Set Similarity Join Tobias Christiani, Rasmus Pagh and Johan Sivertsen, ICDE 2018, Poster Fast Nearest Neighbor Preserving Embeddings…