home.social

Search

1000 results for “recursive”

  1. Did someone manage to run the official knot-resolver container in production? I've been trying it out, but it keeps dropping me into an interactive console and I've got no idea what to pass to make it work as a regular recursive resolver.

    #homelab #dns #knot #KnotResolver #podman

  2. Did someone manage to run the official knot-resolver container in production? I've been trying it out, but it keeps dropping me into an interactive console and I've got no idea what to pass to make it work as a regular recursive resolver.

    #homelab #dns #knot #KnotResolver #podman

  3. Did someone manage to run the official knot-resolver container in production? I've been trying it out, but it keeps dropping me into an interactive console and I've got no idea what to pass to make it work as a regular recursive resolver.

    #homelab #dns #knot #KnotResolver #podman

  4. Did someone manage to run the official knot-resolver container in production? I've been trying it out, but it keeps dropping me into an interactive console and I've got no idea what to pass to make it work as a regular recursive resolver.

    #homelab #dns #knot #KnotResolver #podman

  5. I'm on to my third programming example in #Lua : calculating square roots using the Heron of Alexandria trial and error method. This time it only took me an hour and a half to wrestle with the correct syntax. I originally wanted to make it a recursive algorithm like in the #sicp lecture but maybe for that I should really just use #lisp.

  6. I'm on to my third programming example in #Lua : calculating square roots using the Heron of Alexandria trial and error method. This time it only took me an hour and a half to wrestle with the correct syntax. I originally wanted to make it a recursive algorithm like in the #sicp lecture but maybe for that I should really just use #lisp.

  7. I'm on to my third programming example in #Lua : calculating square roots using the Heron of Alexandria trial and error method. This time it only took me an hour and a half to wrestle with the correct syntax. I originally wanted to make it a recursive algorithm like in the #sicp lecture but maybe for that I should really just use #lisp.

  8. Are you compositionally curious 🤓

    Want to know how to learn embeddings using🌲?

    In our new #ICML2025 paper, we present Banyan:
    A recursive net that you can train super efficiently for any language or domain, and get embeddings competitive with much much larger LLMs 1/🧵

    #embeddings #structure #nlp #semantics #efficient #lowresource

  9. @malin
    I am getting closer to completing the translation of the wee rules booklet for #bindrpg into #German. There is only a single page missing.

    During the process I recursively translated all the glossary entries referenced. This has been more work than expected 😅

  10. I gave in... and rewrote #DBToaster in rust, and it's running its first SQL queries in interpreted mode! Still need to test query differentiation, and I probably won't go full recursive IVM at first, but most of the building blocks exist.

    This version ended up with a query language that looks a lot more like relational algebra than the original AGCA (which is more dataloggy), but the fundamental idea remains: Each tuple is decomposed into an 'identity' component (the key), and an 'annotation' component, which is associated with a Ring- or Group-like combinator.

    As a simple example, the following two relations are identical (assuming attribute 0 is a key, and the value is annotated with the <Z, +, 0> group, or an analogous ring):
    { <1> -> 1, <1> -> 1 } (two copies of the tuple <1, 1>)
    and
    { <1> -> 2 } (one copy of the tuple <1, 2>)

    This change turns out to be huge win, by allowing group-by aggregates to be computed lazily. The relation encodes how multiple tuples need to be coalesced to get the final value. This, in turn, makes push-based query evaluation (and in turn semijoin/magic sets-style optimizations) easier and faster, since aggregation is no longer necessarily a pipeline blocker. Obviously, there are also benefits for IVM.

    On a related note, after working for a long time with the JVM, rust-generated binaries feel like they run too fast. I did a whole lot of dumb things in the interpreter... but it still feels like the console is the bottleneck.

  11. CW: hyper, multicock, "clones", donut butthole, boobs with oversized areola and nipple

    Did you know? Most squirrels actually consist of squirrels. This is a recursive property.

    (Most squirrels are Balros, both by number and by volume.)

    For furaffinity.net/user/echoen and furaffinity.net/user/tisfoolis

    #mink_art #furry #furryart #hyper #multi #multicock #clones #hyper_cock #donut #hyper_boobs #squirrel #snow_leopard

  12. CW: hyper, multicock, "clones", donut butthole, boobs with oversized areola and nipple

    Did you know? Most squirrels actually consist of squirrels. This is a recursive property.

    (Most squirrels are Balros, both by number and by volume.)

    For furaffinity.net/user/echoen and furaffinity.net/user/tisfoolis

    #mink_art #furry #furryart #hyper #multi #multicock #clones #hyper_cock #donut #hyper_boobs #squirrel #snow_leopard

  13. I've got one more #mathober post - today's prompt is "recursion", and this by-hand construction of the Spiral of Theodorus seems sort of recursive. Just keep adding triangles over and over. The length of the hypotenuses are the square roots of 2 through 17 times the edge length of the smallest triangle.

    #spiral #geometry #theodorus #recursion #mathart

  14. I've got one more #mathober post - today's prompt is "recursion", and this by-hand construction of the Spiral of Theodorus seems sort of recursive. Just keep adding triangles over and over. The length of the hypotenuses are the square roots of 2 through 17 times the edge length of the smallest triangle.

    #spiral #geometry #theodorus #recursion #mathart

  15. I've got one more #mathober post - today's prompt is "recursion", and this by-hand construction of the Spiral of Theodorus seems sort of recursive. Just keep adding triangles over and over. The length of the hypotenuses are the square roots of 2 through 17 times the edge length of the smallest triangle.

    #spiral #geometry #theodorus #recursion #mathart

  16. I've got one more #mathober post - today's prompt is "recursion", and this by-hand construction of the Spiral of Theodorus seems sort of recursive. Just keep adding triangles over and over. The length of the hypotenuses are the square roots of 2 through 17 times the edge length of the smallest triangle.

    #spiral #geometry #theodorus #recursion #mathart

  17. Fuzzing? From the CLI? Fast? Say less.

    🕸️ **rwalk**: A blazingly fast web directory scanner.

    🔥 Designed for fast recursive scans and handling large wordlists.

    🦀 Written in Rust!

    ⭐ GitHub: github.com/cestef/rwalk

    #rustlang #web #scanner #directory #commandline #fuzzing #dirsearch

  18. Fuzzing? From the CLI? Fast? Say less.

    🕸️ **rwalk**: A blazingly fast web directory scanner.

    🔥 Designed for fast recursive scans and handling large wordlists.

    🦀 Written in Rust!

    ⭐ GitHub: github.com/cestef/rwalk

  19. Fuzzing? From the CLI? Fast? Say less.

    🕸️ **rwalk**: A blazingly fast web directory scanner.

    🔥 Designed for fast recursive scans and handling large wordlists.

    🦀 Written in Rust!

    ⭐ GitHub: github.com/cestef/rwalk

    #rustlang #web #scanner #directory #commandline #fuzzing #dirsearch

  20. Fuzzing? From the CLI? Fast? Say less.

    🕸️ **rwalk**: A blazingly fast web directory scanner.

    🔥 Designed for fast recursive scans and handling large wordlists.

    🦀 Written in Rust!

    ⭐ GitHub: github.com/cestef/rwalk

    #rustlang #web #scanner #directory #commandline #fuzzing #dirsearch

  21. Fuzzing? From the CLI? Fast? Say less.

    🕸️ **rwalk**: A blazingly fast web directory scanner.

    🔥 Designed for fast recursive scans and handling large wordlists.

    🦀 Written in Rust!

    ⭐ GitHub: github.com/cestef/rwalk

    #rustlang #web #scanner #directory #commandline #fuzzing #dirsearch

  22. NEW BIML Bibliography entry

    arxiv.org/abs/2509.16499

    A Closer Look at Model Collapse: From a Generalization-to-Memorization Perspective

    Lianghe Shi, et al

    A very nice set of references to work in model collapse. Collapsed model == lookup table (that is, no generalization). Discussion of recursive pollution as causing variance shrinkage or distribution shift.

    #TOPPAPER #MLsec #Data #RecursivePollution

    berryvilleiml.com/references/

  23. NEW BIML Bibliography entry

    arxiv.org/abs/2509.16499

    A Closer Look at Model Collapse: From a Generalization-to-Memorization Perspective

    Lianghe Shi, et al

    A very nice set of references to work in model collapse. Collapsed model == lookup table (that is, no generalization). Discussion of recursive pollution as causing variance shrinkage or distribution shift.

    #TOPPAPER #MLsec #Data #RecursivePollution

    berryvilleiml.com/references/

  24. NEW BIML Bibliography entry

    arxiv.org/abs/2509.16499

    A Closer Look at Model Collapse: From a Generalization-to-Memorization Perspective

    Lianghe Shi, et al

    A very nice set of references to work in model collapse. Collapsed model == lookup table (that is, no generalization). Discussion of recursive pollution as causing variance shrinkage or distribution shift.

    #TOPPAPER #MLsec #Data #RecursivePollution

    berryvilleiml.com/references/

  25. Building #unnamedsdvxclone on Debian Stable...

    Install the following:

    cmake
    libfreetype-dev
    libsdl2-dev
    libvorbis-dev
    libarchive-dev
    libssl-dev
    (Yep, a bunch of -dev packages)

    Run the following:
    git clone <url>
    git submodule update --init --recursive
    cmake _DCMAKE_BUILD_TYPE=Release .
    make 

    Then the game binary would be in bin/. Confirms that online downloading songs works

  26. #treemap chart experiment/proof of concept.

    What concept is it proof of?
    1. That #camiJs can do recursive #WebComponents
    2. An idea for a #mermaid / #markDown -like syntax for treemap data

    What's a treemap?
    en.wikipedia.org/wiki/Treemapp
    I guess mine is a simplified version where we alternate splitting by columns and rows.

    artfulrobot.uk/lil/treemap/

  27. #treemap chart experiment/proof of concept.

    What concept is it proof of?
    1. That #camiJs can do recursive #WebComponents
    2. An idea for a #mermaid / #markDown -like syntax for treemap data

    What's a treemap?
    en.wikipedia.org/wiki/Treemapp
    I guess mine is a simplified version where we alternate splitting by columns and rows.

    artfulrobot.uk/lil/treemap/

  28. #treemap chart experiment/proof of concept.

    What concept is it proof of?
    1. That #camiJs can do recursive #WebComponents
    2. An idea for a #mermaid / #markDown -like syntax for treemap data

    What's a treemap?
    en.wikipedia.org/wiki/Treemapp
    I guess mine is a simplified version where we alternate splitting by columns and rows.

    artfulrobot.uk/lil/treemap/

  29. #treemap chart experiment/proof of concept.

    What concept is it proof of?
    1. That #camiJs can do recursive #WebComponents
    2. An idea for a #mermaid / #markDown -like syntax for treemap data

    What's a treemap?
    en.wikipedia.org/wiki/Treemapp
    I guess mine is a simplified version where we alternate splitting by columns and rows.

    artfulrobot.uk/lil/treemap/

  30. CW: Steins;Gate/Steins;Gate 0 Spoilers

    Okabe in #steinsgate0(along with you, the player) towards the end(later routes) is literally creating a recursive function of himself ensuring the conditions are right for reaching the steins gate worldline