cs   30876

« earlier    

Universal Method to Sort Complex Information Found | Quanta Magazine
Altogether, the new papers recast nearest neighbor search for high-dimensional data in a general light for the first time. Instead of working up one-off algorithms for specific distances, computer scientists now have a one-size-fits-all approach to finding nearest neighbor algorithms.

“It’s a disciplined way of designing algorithms for nearest neighbor search in whatever metric space you care about,” said Waingarten.
cs  algorithms 
17 hours ago by euler
Functional Bits: Lambda Calculus based Algorithmic Information Theory
Abstract
In the first part we introduce binary representations of both lambda calculus and combinatory logic, together with very concise interpreters that witness their simplicity. Along the way we present a simple graphical notation for lambda calculus, a new empty list representation, improved bracket abstraction, and a new fixpoint combinator. In the second part we review Algorithmic Information Theory, for which these interpreters provide a convenient vehicle. We demonstrate this with several concrete upper bounds on program-size complexity.
cs  complexity  binary  lambda  calcullus 
2 days ago by euler
scheduling
Paul Krzyzanowski
cs 
5 days ago by lmao
NetLogo Home Page
mentioned in comments of Alvin Roth Google Talk
cs  economics  algorithms 
6 days ago by goodbyedelicious
Tries as the evolution of nothing
The idea behind the tries evolves from doing nothing with unordered digits to the elaborate data structures that excel in big data storage. It is still the same idea, the same principle. Knowing this principle should help you understand the tries, and add them to your arsenal of data structures and algorithms.
cs  tries 
6 days ago by euler

« earlier    

related tags

2016  5.industry.programing.computerscience  academic  academicpublishing  ai  algo  algorithm  algorithms  architecture  artificial_intelligence  assembler  assembly  automation  axe  big-o  bigo  binary  blog  blunt  book  bookmarks_bar  books  boolean  bug  c  calcullus  categorytheory  cg  cheatsheet  classes  clever  cli  clojure  cnf  code  collaborative  complexity  compsci  computer-science  computer  computergraphics  computers  computerscience  computing  computingunplugged  concurrency  course  courses  cpp  cpu  curriculum  dance  data  database  db  deeplearning  delta  design  designs-i-like  diff  differential-synchronization  diffing  diffs  digital_ethics  dijkstra  disss  dnf  ebook  ebooks  eco  economic_history  economics  education  emu  emulator  engineer  essay  ethics  every  explore  expo  fre  free  gendergap  gh  github  guides-tutorials-courses  guru  hardware  history  hobbies  interesting  interpretation  izzy  javascript  javascript_cheatsheet  jk-training  journal  kata  khan_academy  know  lambda  language  learn  learning  lectures  letter  lib  linux  lists  machinelearning  math  maths  metrics  mit  ml  numbers  numericalanalysis  online  operating-systems  operating  os  osdev  overview  paper  papers  pdf  people  physics  pl  procesor  professional  programming  programs  programsynthesis  proof  publication  publications  py  recommendation  reference  regex  relation  repo  research  resources  retrodev  ruby  sat-solver  sat  school  science  search  security  should  sicp  solver  structure  sudoku  sync  synchronization  system  systems  textdiff  theory  tools  toread  tries  truth  tut  tutorial  uncomfortable  university  unix  variance  vid  video  vlsi  wiz  womenintech  youtube 

Copy this bookmark:



description:


tags: