Noah Christopher's repositories
Facial-Recognition-POS-Add-On
Add on that integrates with the LINGAros API to allow users to login with facial recognition
template-app-kotlin-todo
Atlas Template Starter App - Use Device Sync from a Kotlin client application. This repo is generated from source code in https://github.com/mongodb-university/realm-template-apps
NSChristopher.github.io
ML blog documenting my journey in navigating and attempting to comprehend the complex world of AI research.
DATA-UAV_Detection_and_Tracking
Repo for storing required data for private UAV Detection project so it can be easily cloned in Colab.
Personal-Blog
Personal blog for sharing my software development journey.
DatingApp
Find the love of your life!
frigate-ai-nvr
NVR with realtime local object detection for IP cameras
CS280-Recursive-Descent-Parser
Recursive Descent Parsing Consider the following BNF grammar: A -> I = E E -> P O P | P O -> + | - | * | / | ** P -> I | L | UI | UL | (E) U -> + | - | ! I -> C | CI C -> a | b | ... | y | z L -> D | DL D -> 0 | 1 | ... | 8 | 9 Using the technique described in class implement a recursive descent parser that recognizes strings in this language. Input should be from a file called input.txt and output should be to the screen. An example session might look like this (these strings are not necessarily in the language): Input file: a=1 a=a+b-c*d a=a//b++c Output: The string "a=1" is in the language. The string "a=a+b-c*d" is in the language. The string "a=a//b++c" is not in the language. You must implement the project in BOTH Java and C++! Implementations that do not include a solution in both languages will, at best, receive half credit. To simplify things you will not have to handle whitespace when parsing the string, i.e. " " and similiar are illegal characters in this language. All strings should read from a file called "input.txt" and written to the screen.
CS280---Knights-Tour-Algorithm
Knight's Tour: The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. There are several billion solutions to the problem, of which about 122,000,000 have the knight finishing on the same square on which it begins. When this occurs the tour is said to be closed. Your assignment is to write a program that gives a solution to the Knight's Tour problem recursively. You must hand in a solution in C++ AND Java. The name of the C++ file should be "main.cc" and the name of the Java file should be "Main.java". Output should look similar to:
DirectML
DirectML is a high-performance, hardware-accelerated DirectX 12 library for machine learning. DirectML provides GPU acceleration for common machine learning tasks across a broad range of supported hardware and drivers, including all DirectX 12-capable GPUs from vendors such as AMD, Intel, NVIDIA, and Qualcomm.
CS114-MaxHomophones
Reads a document from the internet displaying words with their pronunciations and returns the max number of Homophones in n number of lines.
CS114-Sums
Write a recursive method sums(String s, long n) that determines if +'s can be inserted in the string of digits s so that the resulting arithmetic expression sums to n.
CS114-RecursiveMultiplication
Create a program that multiplies two positive integers recursively.
TipPooler_POC
Proof of concept for future tip pooling application. Application will re alocate tips based on user type, current shift, sales, etc..
CS113-Proj-5-Pascal-s-Triangle
Pascal's Triangle Implement a program to recursively print out Pascal's Triangle: 1: 1 2: 1 1 3: 1 2 1 4: 1 3 3 1 5: 1 4 6 4 1 6: 1 5 10 10 5 1 7: 1 6 15 20 15 6 1 8: 1 7 21 35 35 21 7 1 9: 1 8 28 56 70 56 28 8 1 10: 1 9 36 84 126 126 84 36 9 1 Important questions to ask yourself: What is the base case? What is the recursive case? What should the method return? Your class should be called Pascal and have one static method called triangle that takes an argument 'n' and returns the n-th line of Pascal's Triangle. Here is the code downloadfor the main method that will call the method you write. Only submit Pascal.java, do not submit Main.java.
CS113-Proj-7-Determining-Pi-Experimentally
Determining π Experimentally: Recall that π is the ratio of a circle's circumference to its diameter and that we can calculate the area of a circle with the formula A=πr2. Below is a circle enscribed within the unit square. What is the ratio of the areas of the enscribed circle to that of the unit square? If we pick a random point within the unit square what is the probability that the point will also lie within the circle? If we repeat this experiment an arbitrarily large number of times the ratio of the number of points which lie within the circle to the number of points within the unit square (all of them) will approach π/4. Using the language structures we have discussed write a program that will do the above experiment an arbitary (determined at run-time) number of times and report back the approximate value of π.
CS113-Project-1-Rational-Numbers
Manipulates rational numbers by addition subtraction multiplication and division. Most importantly it needs to output a rational number answer.