Already a member? Log in

Sign up with your...

or

Sign Up with your email address

Add Tags

Duplicate Tags

Rename Tags

Share It With Others!

Save Link

Sign in

Sign Up with your email address

Sign up

By clicking the button, you agree to the Terms & Conditions.

Forgot Password?

Please enter your username below and press the send button.
A password reset link will be sent to you.

If you are unable to access the email address originally associated with your Delicious account, we recommend creating a new account.

ADVERTISEMENT

Links 1 through 10 of 40 by Justin Mason tagged search

'Storing 50,000 2.5KB items in a traditional hash set requires over 125MB, but if you're willing to accept a 1-in-10,000 false positive rate on lookups, [this] bloom filter requires under 500KB' - interesting variation on the basic concept.  Java, Apache-licensed

Share It With Others!

Share It With Others!

Share It With Others!

extensive. the NSFW words that Google Instant won't search for (via Waxy)

Share It With Others!

neat search algo, via Jeremy Zawodny; can be more efficient than binary search (O(log log n)), for indexed, ordered arrays, at the cost of more computation per iteration

Share It With Others!

quite easy, using a Metaphone sound-like indexing scheme to provide the fuzz

Share It With Others!

wow, you can search a time period for everyone who bookmarked pages on a specific site (via Britta)

Share It With Others!

nifty; Apache-licensed distributed, RESTful, JSON-over-HTTP, schemaless search server with multi-tenancy

Share It With Others!

exactly what it says on the tin

Share It With Others!

interesting details in the implementation of PageRank and how it "flows"

Share It With Others!

ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT