Deschide articolul original într-un tab nou Schimbarea acestei opțiuni se aplică imediat și reîncarcă pagina.
LECTURA
← Înapoi la Urmăritori

theoretically good with computers

mcognetta.github.io/feed.xml
Vizitează site-ul

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 9

  1. blunder.clinic, dont blunder

    (theoretically good with computers)

    Launching blunder.clinic, realistic daily chess puzzles.

  2. Decoding GPT-Style Tokens

    (theoretically good with computers)

    Decoding the GPT-style token representation.

  3. Masked Softmax Layers in PyTorch

    (theoretically good with computers)

    Correctly computing masked softmax layers.

  4. Building a DDR Platform

    (theoretically good with computers)

    I built a simple wooden platform for my DDR pad during COVID.

  5. The Lichess Game Compressor's Analysis of Game 1 of the World Championships

    (theoretically good with computers)

    The 2024 Chess World Championships are in the books.

  6. October, or 'That Time of the Year When I Think A Lot About Structured Matrices in Julia'

    (theoretically good with computers)

    A summary of my 2021 Hacktoberfest Julia contributions.

  7. Discord Bot for Esperanto Transcription

    (theoretically good with computers)

    A Discord bot for automatically transcribing x-system Esperanto into Unicode.

  8. Recent Posts List in Franklin.jl

    (theoretically good with computers)

    A simple implementation of an automatically updating recent posts list for Franklin.jl.

  9. Dispatching on Types with the Same UnionAll (but You Don’t Know the Type Beforehand)

    (theoretically good with computers)

    A post about efficiently dispatching on types that are in the same UnionAll, but are possibly different concrete types (for example, A{T} and A{S}) in Julia.