Using elasticsearch in a Rails application - Tutorial Computer Science |
- Using elasticsearch in a Rails application - Tutorial
- Confusion over use of logarithmic notation - log(x) - in Computer Science
- Obstacle Detection Method
- Finding a regular expression for the language {1^n0^m | n is NOT congruent to m, modulo 3}
| Using elasticsearch in a Rails application - Tutorial Posted: 26 Feb 2018 01:13 AM PST |
| Confusion over use of logarithmic notation - log(x) - in Computer Science Posted: 25 Feb 2018 03:39 PM PST Dear r/CompSci, On my Exercise sheet, my professor wrote that we always use log to denote the logarithm of base 2, so log(x) is short for log2(x) This contradicts what I was taught at Sixth Form College, where my teacher said that we should assume log(x) is in base 10, and that lg(x) stood for base 2, ln for base e. Is assuming log(x) is in base 2 a Computer Science thing, or is my professor/teacher wrong? Sorry if this question is too trivial. [link] [comments]  |
| Posted: 26 Feb 2018 01:31 AM PST we have a thesis using vison based obstacle detection and we need a new type of method to do it. any suggestions? [link] [comments]  |
| Finding a regular expression for the language {1^n0^m | n is NOT congruent to m, modulo 3} Posted: 21 Feb 2018 05:36 AM PST Hello I wrote an exam the other day and couldn't figure out the answer to this question and googling did not help either. Maybe anyone can help me figure it out? Example for word in the language: 1110 Example for word NOT in the language: 11110 We defined regular expressions very similar to here https://en.wikipedia.org/wiki/Regular_expression#Formal_definition Thank you for any help or hints! Ruffy [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