×
Home Discussions Write at Opengenus IQ
×

Search anything:

  • DSA Cheatsheet
  • HOME
  • Jobs
  • About
  • One Liner
  • RANDOM
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • AI Engineering
  • Scholarship
  • Campus Ambassador

OpenGenus IQ, an open-source Computer Science Publication House, is driven by 2500+ BSc/MSc/PhD holders globally, exploring Algorithms, Deep Learning, System Design, and more since 2017.

Machine Learning (ML)

Summary: Learning to See by Moving

Research question: Is it also possible to learn useful features for a diverse set of visual tasks using any other form of supervision?

Annie Lee Annie Lee
Machine Learning (ML)

Wiener filter

Wiener filter performs two main functions - it inverts the blur of the image and removes extra noise. It is particularly helpful when processing images that have been through a degradation filter.

Annie Lee Annie Lee
Machine Learning (ML)

Summary: High Performance Convolutional Neural Networks for Document Processing

We have explored the paper "High Performance Convolutional Neural Networks for Document Processing" by Microsoft Research. It explores techniques to compute convolution layer in CNN faster.

Annie Lee Annie Lee
Machine Learning (ML)

Understanding Deep Image Representations by Inverting Them

We have explore the problem that given an encoding of an image, to which extent is it possible to reconstruct the image itself? We have explored the paper "Understanding Deep Image Representations by Inverting Them".

Annie Lee Annie Lee

Contribute and grow 🌱 with Hacktoberfest 2020

Hacktoberfest is a month long virtual event where you can make four contributions towards your favorite Open Source project (such as Cosmos by OpenGenus). You will not only get to learn new things but also get free goodies delivered to you at your doorstep.

Ue Kiao, PhD Ue Kiao, PhD
Data Structures

Count Min Sketch

A count min sketch data structure is a probabilistic data structure (a data structure that provides an approximate solution) that keeps track of frequency.

Ethan Z. Booker
Data Structures

Radix Tree [Compact version of Trie]

radix tree is a compact version of a trie. It takes advantage of this and will store multiple characters / string of text in an edge instead to reduce the number of extra edges and nodes needed.

Ethan Z. Booker
Data Structures

Two Stack Model / Split Buffer for Text Editors

In two stack model, one stack will represent all the contents left of the cursor while the other stack will represent all the contents right of the cursor. Similar is the idea behind Split buffer.

Ethan Z. Booker
Data Structures

Data Structures used in Text Editors

A text editor uses a wide range of data structures to implement different features like search, replacing text and much more. These include char buffer, gap buffer, two stack model, doubly linked list and much more.

Ethan Z. Booker
Algorithms

Reverse a doubly linked list in C++

In this article, we are going to see how to reverse a doubly linked list by reversing the links of each node (without swapping values of nodes) and have implemented the solution using C++.

Harini Jeyaraman Harini Jeyaraman
Algorithms

To check if the linked list is a circular linked list (2 methods)

We will be seeing two efficient methods to determine whether the given linked list is a circular linked list or not. With this, we solve the problem in linear time.

Rashmitha
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

Basics of Hyper Text Transfer Protocol (HTTP)

In this article, we have discussed about HTTP. HTTP stands for Hyper Text Transfer Protocol and is the backbone of the Internet.

Ayush Mehar
Software Engineering

Main points on BASH (Bourne-Again SHell)

In this article, we have covered all major points on BASH Shell which will give you complete knowledge to develop any script to automate tasks.

Kshitiz Saini Kshitiz Saini
Machine Learning (ML)

Overview of Semantic Segmentation

Semantic Segmentation is the process of labeling pixels present in an image into a specific class label. It is considered to be a classification process which classifies each pixel. The process of predicting each pixel in the class is known as dense prediction.

Sandeep Bhuiya
Software Engineering

String Pool in Java

In this article, I have explained the String Pool in Java and how to implement it in Java programming. I have covered basic concepts of this topic. Also, I have explain the diagram.

Pooja Koul
Machine Learning (ML)

Multinomial/ Multimodal Naive Bayes

Multimodal naive bayes is a specialized version of naive bayes designed to handle text documents using word counts as it's underlying method of calculating probability.

Ethan Z. Booker
Machine Learning (ML)

Byte Pair Encoding for Natural Language Processing (NLP)

Byte Pair Encoding is originally a compression algorithm that was adapted for NLP usage. Byte Pair Encoding comes in handy for handling the vocabulary issue through a bottom-up process.

Ethan Z. Booker
Algorithms

Travelling Salesman Problem (Bitmasking and Dynamic Programming)

In this article, we will start our discussion by understanding the problem statement of The Travelling Salesman Problem perfectly and then go through the basic understanding of bit masking and dynamic programming.

Abhijit Tripathy Abhijit Tripathy
Algorithms

Travelling Salesman Problem (Basics + Brute force approach)

In this article we will start our discussion by understanding the problem statement of The Travelling Salesman Problem perfectly and then go through the naive bruteforce approach for solving the problem using a mathematical concept known as "permutation"

Abhijit Tripathy Abhijit Tripathy
Software Engineering

script and scriptreplay in linux

script and scriptreplay are pre-installed commands in Linux. They are more like the utilities which allow the user to record their terminal session and to refer to it anytime he/she needs it.

Kshitiz Saini Kshitiz Saini
Algorithms

Cycle Detection Algorithms

A cycle in a data structure as we have already seen is a condition with no end. A few popular cycle detection algorithms are Floyd's cycle detection algorithm and Brent’s Cycle Detection Algorithm.

Riya Tyagi
Data Structures

Finding the length of a loop in linked list

In this article, we will look at the method of finding the length of a loop in a linked list. For that you should be able to understand Floyd's loop detection algorithm.

Riya Tyagi
Data Structures

Detect a loop in a linked list (3 methods)

A Loop in a linked list is a condition when a Linked list does not have any end. We have explored different ways to detect loop in a linked list like by marking visited nodes, using hashmap and Floyd's cycle finding algorithm.

Riya Tyagi
Software Engineering

Different Types Of Databases

There are 6 different types of Databases which we have covered in depth in our article. It includes centralized, distributed, relational, NoSQL, Object Oriented and Hierarchical database.

Devansh Chaubey Devansh Chaubey
OpenGenus IQ © 2026 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter