finds you similar websites
auto-suggest    top sites

May 6th, 2024

19 Popular Sites Like http://people.csail.mit.e...

moreofit.com has researched the net and identified a lot of high-quality programming and algorithms sites like this one. Come by and explore sites that are similar to this one.

Displaying 41 to 50 of 500 alternatives to http://people.csail.mit.edu/bdean/6.... (Updated: May 6th, 2024)     [about these results]
Advanced Options
? Sort by:
popularity similarity
? Must Include:
? Cannot Include:
? Look For


Sponsored Links
 
You're looking for other sites like :
  Dynamic Programming Practice Problems
No information avaiable
http://people.csail.mit.edu/bdean/6.046/dp/
popularity:
programming
algorithms
algorithm
dynamic
dynamicprogramming
problems
interview
mit
c++
practice
new search by a custom tag signature
  Levenshtein distance - Wikipedia, the free encyclopedia
Retrieved from "http://en.wikipedia.org/wiki/Levenshtein_distance" Categories: Algorithms on strings | String similarity measures | Dynamic programming ...
similarity:
popularity:
algorithm
programming
algorithms
levenshtein
string
search
spellcheck
comparison
text
statistics
  How to Write a Spelling Corrector
But they didn't, and come to think of it, there's no reason they should: it was ... I figured they and many others could benefit from an explanation. The ...
similarity:
popularity:
python
programming
algorithms
spelling
spellcheck
algorithm
code
probability
development
statistics
  Longest Common Subsequences
No information avaiable
similarity:
popularity:
algorithms
programming
lcs
algorithm
diff
string
text
search
development
lecture
  きまぐれ日記: 動的配列への追加コストはなぜ O(1)?
動的配列への追加コストは O(1) ってのは覚えていればそれだけの話ですが,どうしてかと言われると意外と難しいものです. というのも, このO(1)ってのは動的配列の実装方法に ... 一般論として,1つ要素を追加するとき,配列に空きがなかったら新しく配列を作り直して全要素をコピーする必要があります.コピーのコストは O ...
similarity:
popularity:
algorithm
programming
perl
array
algorithms
dynamic
memory
  B-Trees
Tree structures support various basic dynamic set operations including Search, ... Ideally, a tree will be balanced and the height will be log n where n is the ...
similarity:
popularity:
algorithms
programming
b-tree
btree
algorithm
b-trees
database
datastructures
tree
trees
  HAKMEM -- CONTENTS -- DRAFT, NOT YET PROOFED
[Retyped and formatted in 'html' ('Web browser format) by Henry Baker, ... Therefore, equations have been formatted to be readable even on ASCII browsers ...
similarity:
popularity:
  Plain english explanation of Big O - Stack Overflow
No information avaiable
similarity:
popularity:
algorithms
programming
complexity
big-o
bigo
algorithm
math
performance
reference
development
  Fast inverse square root - Wikipedia, the free encyclopedia
No information avaiable
similarity:
popularity:
programming
mathematics
math
algorithms
c++
hack
squareroot
algorithm
wikipedia
code
  How Not To Sort By Average Rating
You want to put the highest-rated stuff at the top and lowest-rated at the bottom. You ... WRONG SOLUTION #1: Score = (Positive ratings) - (Negative ratings) ...
similarity:
popularity:
statistics
programming
rating
algorithms
sorting
math
algorithm
development
ratings
ranking
  Skiena's Audio Lectures
No information avaiable
similarity:
popularity:
algorithms
lectures
programming
video
algorithm
videos
cs
reference
course
skiena
< prev ... 1 2 3 4 5 6 7 ... 50 next >
Sorting Results
  • This slider determines how the matched sites are sorted.
  • If you want to see the most popular sites that are somewhat related to your search, slide this more towards "popularity."
  • If you want to see the sites that best matched your search, regardless of popularity, slide this towards "similarity."
Must Include Tags
  • Matched sites will not be shown unless they have all of the tags on this list.
  • This feature is useful for when you require a site to have been tagged as something.
  • To add a tag to this list, click "add tag" or click on any tag in a result.
Must Not Include Tags
  • Matched sites that have any tag on this list will not be shown.
  • This feature is useful for filtering out results that have tags you are absolutely not interested in.
  • To add a tag to this list, click "add tag" or click on any tag in a result.
Types of Results
  • This option lets you specify the types of sites to show.
  • If you want to only see domains (www..com), select "domains only."
  • If you want to only see articles (www..com/something/here), select "articles only."
  • If you don't care, or care so much about both, select "Both".
About The Results
an example search result
How moreofit Searches
Each website has a unique tag signature -- a set of words that users have described the website as. Moreofit searches for websites that have similar tag signatures and displays the results.
1: Similarity
A site's "similarity" is determined by how well its tag signature matches the tag signature that is being searched for. A 100% match means that it has the exact same tags in the exact same order, while a 0% match means it has no tags in common.
2: Popularity
The popularity of a website is, well, pretty much self explanatory.
3: Tag Signature
The tag signatures show how a site is described. The deeper the color of the tag, the more frequently the website is tagged as this. Tags underlined blue denote a tag that is in common with the search's tag signature.