#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2012

- This year (0)
- Last 5 years (3)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimizing Boolean sum of products function with binary decision diagram and with disjoint sum of product minimization. Due to the symbolic representation of cubes for large problem… (More)

- Murari Mohan Sardar, Krishnendu Basuli, Saptarshi Naskar
- Ubiquity
- 2008

The term CBIR seems to have originated in 1992, when it was describe experiments into automatic retrieval of images from a database, based on the colors and shapes present. Since then, the term has been used to describe the process of retrieving desired images from a large collection on the basis of syntactical image features. The techniques, tools and… (More)

The most popular algorithms for generation of minimal spanning tree are Kruskal’s[2] and Prim’s[2] algorithm. Many algorithms have been proposed for generation of all spanning tree. This paper deals with generation of all possible spanning trees in increasing cost of a weighted graph. This approach uses one matrix called Difference Weighted Circuit Matrix… (More)

- Saptarshi Naskar, Krishnendu Basuli, Samar Sen Sarma, Kashi Nath Dey
- Ubiquity
- 2008

I ndi got her BS in Computer Science from Cal Poly and began her master's at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap. Her expertise ranges from structuring crossfunctional teams, to managing… (More)

- Krishnendu Basuli, Saptarshi Naskar
- Ubiquity
- 2008

Most of the physical and mathematical problems can be formulated in terms of Graph Theory [1]. Generation of a single spanning tree for a simple, symmetric and connected graph G is well known polynomial time solvable problem [1]. Also there are some intractable problems like Graph Coloring, Vertex Connectivity, Isomorphism etc. in graph theory [2,3]. To… (More)

- Saptarshi Naskar, Krishnendu Basuli, Samar Sen-Sarma
- Ubiquity
- 2008

Serial communication is the process of sending data sequentially one bit at a time, over a communication channel or computer bus [5,6,7]. RS-232 is a standard for serial binary data transfer between a data terminal equipment (DTE) and a data circuit-terminating equipment (DCE), commonly used in computer serial ports.

** (West Bengal University of Technology, West Bengal, India) *** (West Bengal State University, West Bengal, India) ABSTRACT Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing… (More)

- ‹
- 1
- ›