×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner
Priyanshi Sharma

Priyanshi Sharma

Priyanshi Sharma is SWE at Google and had completed B.Tech in CSE at NIT Raipur in 2022. She interned at Google (2021) and OpenGenus (2020) and authored a book "Problems in AI".

Gautam Buddha Nagar, Uttar Pradesh, India •
15 posts •
Deep Learning

Winograd's Convolution Theorem [Explained]

Winograd Convolution proved a lower bound on the number of multiplications required for convolution, and used Chinese Remainder Theorem to construct optimal algorithm to achieve minimum number of multiplies.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Convolution Filters / Filters in CNN

Convolution filters are filters (multi-dimensional data) used in Convolution layer which helps in extracting specific features from input data. There are different types of Filters like Gaussian Blur, Prewitt Filter and many more which we have covered.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Concrete Problems in AI Safety

In this article we shall explore a research paper titled “Concrete Problems in AI Safety” by Dario Amodei and others. This has been a very influential paper.

Priyanshi Sharma Priyanshi Sharma
Software Engineering

Chrome Dinosaur (T-Rex 🦖) game with Processing in Java

We have designed and developed the Chrome dinosaur game (T-Rex game) and implemented it in Java using Processing.

Priyanshi Sharma Priyanshi Sharma
Software Engineering

Regex Expressions in Java

Regex Expressions are a sequence of characters which describe a search pattern. It is generally used for 'find', 'find and replace' as well as 'input validation'. This article shall focus on how to write a Regex Expression in Java.

Priyanshi Sharma Priyanshi Sharma
Software Engineering

Snake Game in Java (OOP design concepts)

In this article, we have explored how to design the classical Snake Game using Object Oriented Programming (OOP) concepts and implement it using Java.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Advancing AIML to build a chatbot

In this article, we have explored some advanced concepts in AIML (Artificial Intelligence Markup Language) such as sets, maps, the '$' wildcard, loops, Rich Media Elements, buttons, hyperlinks, formatting and much more.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Getting started with AIML to create Chatbots

AIML stands for Artificial Intelligence Markup Language and is used to create Chatbots. This article contains some basic utilities which can equip you to write a fulling functioning AIML bot.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Everything about Pooling layers and different types of Pooling

We have explored the idea and computation details behind pooling layers in Machine Learning models and different types of pooling operations as well. In short, the different types of pooling operations are Maximum Pool, Minimum Pool, Average Pool and Adaptive Pool.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

MaxPool vs AvgPool

In this article, we have explored the difference between MaxPool and AvgPool operations (in ML models) in depth. In short, in AvgPool, the average presence of features is highlighted while in MaxPool, specific features are highlighted irrespective of location.

Priyanshi Sharma Priyanshi Sharma
Machine Learning (ML)

Purpose of different layers in a Deep Learning Model

In this article, we have explored the significance or the importance of each layer in a Machine Learning model. Different layers include convolution, pooling, normalization and much more. For example: the significance of MaxPool is that it decreases sensitivity to the location of features.

Priyanshi Sharma Priyanshi Sharma
Data Structures

Binary Space Partitioning Trees

Binary Space Partitioning Trees is a method of recursively subdividing a space into two convex sets by using hyperplanes as partitions. The resulting data structure is a binary tree, and the two subplanes are referred to as front and back.

Priyanshi Sharma Priyanshi Sharma
Data Structures

Space partitioning trees

Space partitioning trees are tree data structures that partition a N-dimensional data space into different components for specific tasks. Examples of Space partitioning trees include Binary Space Partitioning tree, Octree and many more.

Priyanshi Sharma Priyanshi Sharma
Software Engineering

Call by Value vs Call by Reference in C++

'Call' refers to calling a function. Both of these (Call by Value and Call by Reference) are methods of function invocation. The difference, lies in formal parameters

Priyanshi Sharma Priyanshi Sharma
Software Engineering

Reference vs Pointer in C++

In this article, we have explained the difference between reference and pointer in C++ in detail. In short, reference is an alternative name for a variable while pointer is a variable that contains memory address of another variable.

Priyanshi Sharma Priyanshi Sharma
OpenGenus IQ © 2025 All rights reserved ™
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship