YAWYSIWYGEE: Yet another what-you-see-is-what-you-get equation editor Computer Science |
- YAWYSIWYGEE: Yet another what-you-see-is-what-you-get equation editor
- Main uses of Python Programming Language
- Any one from USA..?
- (How to calculate) False positivity rate of lookup when using a pair of fingerprints of hashes
- Set theory and transfinite numbers in 100 symbols
- [N] NeurIPS Extends Paper Submission Deadline In Support of Black Community
- Chat with a question-answering AI based on Banned Books - or watch the results live!
- Latest from apple researchers: Deep learning approach for driving animated faces using both acoustic and visual information.
- CS student here. What are must-have technical skills?
- help for web project
- Windows, Linux or Mac OS
YAWYSIWYGEE: Yet another what-you-see-is-what-you-get equation editor Posted: 02 Jun 2020 09:23 AM PDT |
Main uses of Python Programming Language Posted: 02 Jun 2020 10:44 PM PDT |
Posted: 03 Jun 2020 03:11 AM PDT |
(How to calculate) False positivity rate of lookup when using a pair of fingerprints of hashes Posted: 03 Jun 2020 02:51 AM PDT I thought of a data structure (let's call it twin fingerprints) similar to cuckoo filters that I hope might beat cuckoo filters for very low rates of false positives (think 10-13). The idea: For every entry, we calculate two hashes (makes collisions highly unlikely, similar to cuckoo filters) and store the two fingerprints (of f bits) of the hashes (in order to save space) as a pair. In order to calculate whether this idea has merit, I need to answer the following question: Given n entries and fingerprints of f bits. For a number m not in the list, how likely is it to yield a pair of fingerprints that is in the list (= false positive lookup)? I am aware that the hash functions will play a role in this, but I don't know what their role in this calculation will be either. A closed formula would be great, but I am gratefull for any resource or pointer! I don't want to dig deep if I don't have too, but if I have, I would work through the subsection "hashes" in my copy of "Concrete Mathematics" and/or through the analysis of the cuckoo filter paper from 2004. Lookup by going through a list of pairs is horribly slow! Yes, in practise I would use a hashmap for that. For the purpose of simplification, I stated that we use a list of pairs, since my primary concerns is the chance of a false positive lookup. This is just a cuckoo filter in bad! I hope not! Like a cuckoo filter, we use two hash functions. However, cuckoo filters only use one hash function, and their main purpose is to find the position of the fingerprint. We don't use the hashes as a guide on the entries' position, but as seeds for the fingerprint pair (hopefully, a very compact, yet very distinct representation). The hope is that instead using a single long fingerprint to achieve a low rate of false positives, we can achieve the same low rate of false positives using a pair of two short fingerprints with the implicit knowledge that both fingerprints belong to the same entry. [link] [comments] |
Set theory and transfinite numbers in 100 symbols Posted: 02 Jun 2020 05:14 PM PDT |
[N] NeurIPS Extends Paper Submission Deadline In Support of Black Community Posted: 02 Jun 2020 12:34 PM PDT Today, organizers of the 34th Conference on Neural Information Processing Systems (NeurIPS 2020) announced extending the paper submission deadline by 48 hours. The new deadline is Friday, June 5, 2020, at 1 pm PDT. Here is a quick read: NeurIPS Extends Paper Submission Deadline In Support of Black Community [link] [comments] |
Chat with a question-answering AI based on Banned Books - or watch the results live! Posted: 02 Jun 2020 07:22 PM PDT I fed an AI context from banned books, from serial killers to Noam Chomsky to the occult and strange to some fairly complex manifestos. Note - it's a question answering bot, not a chatbot. It has no context from your previous questions, and it's simply answering whatever new question it's given. It has no sense of 'self' and doesn't get questions like 'Have you read Brave New World?' (which also isn't a banned book, mind you). Have a try: http://jare.cloud/banned-books-bot/ watch the questions and answers live: https://youtu.be/sEWGbw7dJGs [link] [comments] |
Posted: 02 Jun 2020 04:05 PM PDT |
CS student here. What are must-have technical skills? Posted: 02 Jun 2020 06:38 AM PDT Hi, I'm a rising sophomore in UG right now. I don't know a ton of CS but I'm becoming more interested in it and might potentially switch majors to CS. I have a few questions.
Thanks so much. :-) [link] [comments] |
Posted: 02 Jun 2020 09:51 AM PDT Can someone please share where can i follow tutorials to develop a web project like e-commerce or job portal (etc). It can be free/paid. [link] [comments] |
Posted: 02 Jun 2020 12:06 PM PDT Ok so im going into university for computer science so im wondering which operating system would be the best for a computer science student. [link] [comments] |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment