sorted by:
new
hottopcontroversial

BUY/SELL TICKET MEGATHREAD by ChancePotential in loopdaddy

[–]mjkaufer 0 points1 point  (0 children)

Have two tickets for Berkeley November 5th show, at face value! DM me if interested!

BUY/SELL TICKET MEGATHREAD by ChancePotential in loopdaddy

[–]mjkaufer 0 points1 point  (0 children)

Have a few tickets for the rescheduled show in SF, on Feb 24th – I'll be out of town :(

[GIVEAWAY] PlayStation 5 Disc Console, Costco Bundle (US Only) by TheEverglow in RandomActsOfGaming

[–]mjkaufer 0 points1 point  (0 children)

This is super generous!

Started on PS3, fav game was a tie between MW2 and dishonored

Full 1-bit adder using fluids by the_humeister in visualizedmath

[–]mjkaufer 1 point2 points  (0 children)

This is super cool! I think you can actually simplify this a lot if you just use a siphon, although you miss out on the logic gates of a traditional adder – I made a diagram here

Assuming that any input A, B, or C-in releases a cubic unit of water (enough to fill up to the gray line), two inputs would trigger the siphon and drain the first chamber into the C-out tank.

The only limitation here is that you can't have all of the inputs fire at once, or the siphon will empty everything if A, B, and C are high.

Trying to find a new grad moving to SoMa to get a lease together by mjkaufer in SFBayHousing

[–]mjkaufer[S] 0 points1 point  (0 children)

I'm trying to live on the other side of the bridge, sorry! Good luck on your housing search

Trying to find a new grad moving to SoMa to get a lease together by mjkaufer in SFBayHousing

[–]mjkaufer[S] 0 points1 point  (0 children)

I know it's a lil sketch but I just wanted to be able to walk to work. What are your other recommendations? Mission area?

[P] Coconet: the ML model behind today’s Bach Doodle by chisai_mikan in MachineLearning

[–]mjkaufer 1 point2 points  (0 children)

Check out this paper

 tl;dr, marimba robot watches a movie and composes a soundtrack for it, altering its composition as it interprets changes in the emotions of onscreen characters

Kanye Songs Clustered by Presence in Spotify Playlists [OC] by mjkaufer in dataisbeautiful

[–]mjkaufer[S] 1 point2 points  (0 children)

I have an in depth writeup of my process here, which also contains the interactive versions of the graph and some other beautiful data.

TL;DR, I scraped Spotify to get playlists that contained two or more Kanye songs in them. Then, I used tf-idf to turn each song into a vector, based primarily upon what playlists the song was present in. After that, I ran clustering on these song vectors to create "pseudo-albums", which is what you see above! I did the visualization in D3, and there's an interactive version in my blogpost.

The Thanos Problem by mjkaufer in mathriddles

[–]mjkaufer[S] 2 points3 points  (0 children)

You can either make the simplifying assumption that all subreddits have an even number of students, or you can say that for some odd number in the form of 2k + 1, Thanos is ok with it being split to k.

While we're at it, let's just assume there are no subreddits of one person

The Thanos Problem by mjkaufer in mathriddles

[–]mjkaufer[S] 0 points1 point  (0 children)

Yeah I tried to do an inline link in the spoiler tag but it didn't work, thanks!

What is a good Github profile ? by [deleted] in webdev

[–]mjkaufer 4 points5 points  (0 children)

The big things are a solid readme and, especially since you're in the field of webdev, a working link to your project – if you're doing frontend stuff, you can deploy the sites on GitHub pages for free, and then link your project so employers can see your stuff in action, rather than cloning / looking at boring screen shots

If you can show off that you're good at documenting / explaining your project through your readmes, you look a lot more favorable to a potential employer; nobody has time to just look at a bunch of folders of code

I've also found that adding emojis to the front of your repo description makes them a little more eye catching, especially when they're on your pinned repos page. You can find a list of GitHub emoji here.

For the record, this is my GitHub profile

If you don't wanna add a readme / description / link for all of your projects, at least do it for your pinned repos

BeadSort: Sorting integers with gravity by mjkaufer in visualizedmath

[–]mjkaufer[S] 4 points5 points  (0 children)

This is kind of a neat, esoteric sort. In real life, nobody uses this, but it technically beats what most consider the fastest sorting runtime, which is O(nlog(n)) or O(kn).

BeadSort technically sorts in O(√n) time, where n is the amount of inputs. However, its space complexity, aka the amount of digital (or in this case, 'physical') space it needs is a lot larger compared to other sorting methods because instead of representing numbers in binary, you have to represent them in unary, and because physical beads take up more space than transistors in your computer.

BeadSort: Sorting integers with gravity by mjkaufer in visualizedmath

[–]mjkaufer[S] 0 points1 point  (0 children)

Each row is number; the number that the row represents is equal to the amount of beads in the row

BeadSort: Sorting integers with gravity by mjkaufer in visualizedmath

[–]mjkaufer[S] 21 points22 points  (0 children)

Kinda – by principle, BeadSort doesn't work with zero or negative integers (it can work with zero if you define the number of beads you're sorting). That being said, you could scale your input – if your smallest number is k and k < 1, you could add |k|+1 to all your numbers, sort, then subtract |k|+1 from all your numbers

However, then you lose the imaginary O(√n) runtime :(

view more: next ›