#### Filter Results:

#### Publication Year

1999

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yogita Dubey, Divakar Singh, Anju Singh, Paramjit Kaur, Rupinder Kaur, Sarita Sharma +6 others
- 2016

Software testing is one of the most important parts of the software development. It also takes too much time to complete, because there are test cases are used for the testing of the software. So data mining techniques are used to improve the performance of the testing by reducing the size of the test cases. In this paper a Parallel Early Binding Recursive… (More)

- M. N. Murty
- 2013

In this paper, novel recursive algorithms for realization of one-dimensional discrete sine transform (DST) and inverse discrete sine transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear… (More)

- M N Murty
- 2013

This paper presents a new algorithm for the implementation of an N-point prime-length discrete sine transform (DST) through cyclic convolution. The proposed algorithm is based on the idea of reformulating prime N-length DST into two 1/2-point cyclic convolutions. Thus, the hardware complexity can be reduced. This cyclic convolution –based algorithm is used… (More)

- M N Murty, I Introduction
- 2013

In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = í µí¿ í µí² (í µí² ≥ í µí¿) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations.… (More)

- M. N. Murty
- 2012

Discrete Hartley transform is an important tool in digital signal processing. This paper presents a novel recursive algorithm for realization of one-dimensional discrete Hartley transform of even length. The transform is constructed by single folding of input data and using Chebyshev Polynomial. Single folding algorithm provides data throughput two times of… (More)

- A K Jain, M N Murty, P J Flynn, J R Figueira, Y De Smet, B Mareschal +2 others
- 2011

[6] A. Valls Mateu, CLUSDM: a multiple criteria decision making method for heterogeneous data sets, Polytechnic University of Catalonia. 2002. [8] B. Roy.Critères multiples et mod´elisation des pr´ef´erences : l'apport des relations de surclassement. Revue d'Economie Politique, 1974. [10] R. Bisdorff. Electre-like clustering from a pairwise fuzzy proximity… (More)

In the Hopfield model of content addressable memory, the number of spurious attractors is exponential in the di-mensionality of the memory. Hence it is highly 'ikely that the system converges to a spurious memory on ar arbitrary input. It is desirable that the system has a way c:f checking whether its state corresponds to any one of the stored patterns. In… (More)

- ‹
- 1
- ›