Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work shows that given a set S of n points with coordinates on an n × n grid, it can construct data structures for reporting and counting the maximal points in an axes-parallel query rectangle in sub-logarithmic time.
••
15 Nov 2009TL;DR: Two new algorithms for GIS Mobile query (point-in-area function) are proposed that search the status of a given co-ordinate point with respect to an area.
Abstract: In this paper two new algorithms for GIS Mobile query (point-in-area function) are proposed. This algorithm search the status of a given co-ordinate point with respect to an area (described as a set of co-ordinates without any geometric relationship). In these algorithms computational complexity are reduced. One of the algorithms is much closed to the accuracy of exhaustive search.
••
TL;DR: In this paper, the invex programming problem in Hilbert space was introduced and the requisite theory has been established to characterize the solution of such class of problems, which is the case of the problem we consider in this paper.
Abstract: In this paper we introduce the invex programming problem in Hilbert space. The requisite theory has been established to characterize the solution of such class of problems.
••
TL;DR: An opportunistic, sensing based spectrum sharing method is employed and flexible power selection strategy as per channel state information is considered to maximize secondary user channel capacity.
Abstract: A flexible transmit power selection concept for underlay cognitive users is proposed in this paper. We have employed an opportunistic, sensing based spectrum sharing method. Besides the power constraint to avoid interference at PU, the transmit power constraints of secondary user is also considered. Received Signal Strength Indicator based carrier selection method has been adopted. To resolve hidden terminal problem, twin scan concept is used at both ends (secondary transmitter and receiver) with same carrier frequency. Secondary transmitter selects suitable carrier frequency to initiate communication with the minimum power level as defined by the proposed algorithm. If received signal strength at the corresponding secondary receiver is below the predefined required receiver threshold, then power level is stepped up automatically. To maximize secondary user channel capacity, we have considered flexible power selection strategy as per channel state information. If the cognitive receiver is unable to recover the received information, even with the peak transmit power, it will again perform the frequency scanning operation. This is repeated till the best result is achieved. A power control circuit is designed to check the power selection concept.
••
20 Nov 2014
TL;DR: Experimental results show that GA-based tuning and feature weighting scheme increases the performance of NPPC by ~ 2% in the problem of black tea quality prediction.
Abstract: Electronic nose (e-nose) is an artificial olfaction system that is being widely used in many industries. E-noses detect smells with the help of electronic signals produced by a number of sensors. The important part of an efficient e-nose system is to recognize these electronic signals accurately by some pattern classification algorithm. Recently developed nonparallel plane proximal classifier (NPPC) has shown its effectiveness in pattern classification task using kernel trick. In general the performance of such classifier depends on the values of optimal parameter set as well as the feature set. In this research work we have studied the effect of simultaneous parameter and feature weight selection on the accuracy of black tea quality estimation employing multiclass one vs. one NPPC. In order to choose the model parameters we have used genetic algorithm (GA). Experimental results show that GA-based tuning and feature weighting scheme increases the performance of NPPC by ∼ 2% in the problem of black tea quality prediction.
Authors
Showing all 581 results
Name | H-index | Papers | Citations |
---|---|---|---|
Debnath Bhattacharyya | 39 | 578 | 6867 |
Samiran Mitra | 38 | 198 | 5108 |
Dipankar Chakravorty | 35 | 369 | 5288 |
S. Saha Ray | 34 | 217 | 3888 |
Tai-hoon Kim | 33 | 526 | 4974 |
Anindya Sen | 29 | 109 | 3472 |
Ujjal Debnath | 29 | 335 | 3828 |
Anirban Mukhopadhyay | 29 | 169 | 3200 |
Avijit Ghosh | 28 | 121 | 2639 |
Mrinal K. Ghosh | 26 | 64 | 2243 |
Biswanath Bhunia | 23 | 75 | 1466 |
Jayati Datta | 23 | 55 | 1520 |
Nabarun Bhattacharyya | 23 | 136 | 1960 |
Pinaki Bhattacharya | 19 | 114 | 1193 |
Dwaipayan Sen | 18 | 71 | 1086 |