@Moosader stack/heap differentiation and memory allocation in general. I'm tired of things that complexity-wise would run on a C64 bringing my modern r9 with 128 gigs of ram to it's knees O_x
🐍 aprxc — A #Python#CLI tool to approximate the number of distinct values in a file/iterable using the Chakraborty/Vinodchandran/Meel’s (‘coin flip’) #algorithm¹.
Are you looking for cutting-edge books 📚 on #technology and #computerscience? Then check out Leanpub, where our authors' ebooks are published and updated as they're being written on emerging trends and new developments, and tech that can change day-by-day
#kdtree and ball trees seem cool, but require full knowledge of the thing I'm searching for. What if it's 7 dimensional and I only know 4 of the values?
I feel like a "parallel kd tree" with a separate binary index on each dimension would work better here.
Reduce depth. Allow unspecified values. It'd also be a snap to create and search each dim in parallel.
If you are interested in presenting "work in progress" that intersects computing and society, consider submitting a talk to ACM SIGCAS Works In Progress (WIP). These are online discussions where you can present your work, discuss it with the SIGCAS community, and gain insightful feedback.
#BASIC#ProgrammingLanguages#ComputerScience: "Sixty years ago, on May 1, 1964, at 4 am in the morning, a quiet revolution in computing began at Dartmouth College. That's when mathematicians John G. Kemeny and Thomas E. Kurtz successfully ran the first program written in their newly developed BASIC (Beginner's All-Purpose Symbolic Instruction Code) programming language on the college's General Electric GE-225 mainframe.
Little did they know that their creation would go on to democratize computing and inspire generations of programmers over the next six decades."