Image Processing This is a research group under the Computer Science and Engineering Department at National Institute of Technology, silchar.  This group is dedicatedly working on understanding visual processes and finding solutions for the outstanding problems in visual processing and perception, as well as artificial intelligence, machine learning, Medical Imaging and intelligent systems for a wide variety of applications. This group also focused on pushing the boundaries of AI by tackling the key operational challenges surrounding widespread adoption of AI and enabling AI to become Continue reading →

Quantum Computing Quantum computing exploits the power of quantum mechanics for computation. Quantum bit or Qubit allows the existence of three states 0, 1, or both. There are various classical algorithms like np, which take a longer computational time. The computational time is possible to reduce with the help of superposition and Entanglement in quantum computing. Some well-known quantum algorithms are the Deutsch algorithm, Deutsch-Jozsa algorithm, QFT, Shor algorithm, Phase estimation, Grover search etc. The main obstacles of quantum computing are Decoherence, Quantum noise, physical Continue reading →

Network Security Network security is a broad term that covers a multitude of technologies, devices and processes. In its simplest term, it is a set of rules and configurations designed to protect the integrity, confidentiality and accessibility of computer networks and data using both software and hardware technologies. Every organization, regardless of size, industry or infrastructure, requires a degree of network security solutions in place to protect it from the ever-growing landscape of cyber threats in the wild today. [Source] Faculty Members: Dr. Ripon Patgiri, Assistant Continue reading →

Computational Geometry Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity.[Source] Faculty Members: Dr. Shyamosree Pal, Assistant Professor Publications: [1] P. Bhowmick and Continue reading →

Data Structures & Algorithms A computer program is a collection of instructions to perform a specific task. For this, a computer program may need to store data, retrieve data, and perform computations on the data. A data structure is a way to store and organize data in order to facilitate access and modifications. And, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus Continue reading →