Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

83 results for “computational cost”
Set a search alert
Research ArticleOpen accessIn the abstractAN EFFICIENT POWER REDUCTION TECHNIQUE IN ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING SYSTEM USING TONE RESERVATIONV. Nandalal, S. SophiaIn a basic communication system, the data’s are modulated onto a single carrier frequency. The available bandwidth is then totally occupied by each symbol. This kind of system can lead to Inter-Symbol-Interference (ISI) in case of frequency selective fading. The basic idea of Orthogonal Frequency Division Multiplexing (OFDM) is to divide the available spectrum into several orthogonal sub channels so … …Journal of Computer Science, Vol. 9, Issue 9 · 6 Aug 2013 · 6,471 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Image Dithering Via Tchebichef Moment TransformNur Azman Abu, Ferda Ernawan, Nanna SuryanaMany image display applications and printing devices allow only limited number of colours. They have limited computational power and storage to produce high quality outputs on high bit-depth colour image. A dithering technique is called for here in order to improve the perceptual visual quality of the limited bit-depth images. A dithered image is represented by a natural colour in … …Journal of Computer Science, Vol. 9, Issue 7 · 11 Jun 2013 · 7,341 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Algorithm for Mining Spatially Co-located Moving ObjectsG. Manikandan, S. SrinivasanMining co-location patterns from spatial databases may disclose the types of spatial features which are likely located as neighbors’ in space. Accordingly, we present an algorithm previously for mining spatially co-located moving objects using spatial data mining techniques and Prim’s Algorithm. In the previous technique, the scanning of database to mine the spatial co-location patterns took much computational cost. In … …American Journal of Applied Sciences, Vol. 10, Issue 3 · 2 Mar 2013 · 6,649 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnt Colony Optimization for Container Loading ProblemC. N. Yap, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Container Loading Problem (CLP) considers packing a subset of given rectangular boxes into a rectangular container of fixed dimensions in the most optimum way. This was very important in the logistics industries and warehousing problems, since the cost can be reduced by increasing the space utilization ratio. Approach: This problem was solved in a two-phased Ant Colony … …Journal of Mathematics and Statistics, Vol. 8, Issue 2 · 20 Mar 2012 · 8,561 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDFCite
Research ArticleOpen accessIn the abstractSteel Plates Faults Diagnosis with Data Mining ModelsMahmoud Fakhr, Alaa M. ElsayadProblem statement: Over the last two decades, Fault Diagnosis (FD) has a major importance to enhance the quality of manufacturing and to lessen the cost of product testing. Actually, quick and correct FD system helps to keep away from product quality problems and facilitates precautionary maintenance. FD may be considered as a pattern recognition problem. It has been gaining more … …Journal of Computer Science, Vol. 8, Issue 4 · 31 Jan 2012 · 11,378 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Classification of Cancer using Support Vector Machines and Modified Extreme Learning Machine based on Analysis of Variance FeaturesA. Bharathi, A.M. NatarajanProblem statement: The primary objective is to propose efficient cancer classification techniques which provide reliable and significant classification accuracy. To achieve this primary research goal is to find the smallest set of genes that can ensure high accuracy in classification using supervised machine learning algorithms. The significance of finding the minimum subset is three fold: (a) The computational burden and … …American Journal of Applied Sciences, Vol. 8, Issue 12 · 22 Oct 2011 · 7,441 accessesView PDFCite
Research ArticleOpen accessIn the abstractCancer Classification using Support Vector Machines and Relevance Vector Machine based on Analysis of Variance FeaturesA. Bharathi, A.M. NatarajanProblem statement: The objective of this study is, to find the smallest set of genes that can ensure highly accurate classification of cancer from micro array data by using supervised machine learning algorithms. The significance of finding the minimum subset is three fold: The computational burden and noise arising from irrelevant genes are much reduced; the cost for cancer testing … …Journal of Computer Science, Vol. 7, Issue 9 · 25 Jul 2011 · 7,593 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Independent Rough Set Approach Hybrid with Artificial Bee Colony Algorithm for Dimensionality ReductionNambiraj Suguna, Keppana Gowder ThanushkodiProblem statement: Dimensionality reduction is viewed as an important pre-processing step for pattern recognition and data mining. As the classical rough set model considers the entire attribute set as a whole to find the subset, comparing all possible combinations of sets of attributes is difficult. Approach: In this study, we have introduced an improved Rough Set-based Attribute Reduction (RSAR) namely … …American Journal of Applied Sciences, Vol. 8, Issue 3 · 25 Mar 2011 · 8,334 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Newton's Method with Diagonal Jacobian Approximation for Systems of Nonlinear EquationsM. Y. Waziri, W. J. Leong, M. A. Hassan, M. MonsiProblem statement: The major weaknesses of Newton method for nonlinear equations entail computation of Jacobian matrix and solving systems of n linear equations in each of the iterations. Approach: In some extent function derivatives are quit costly and Jacobian is computationally expensive which requires evaluation (storage) of n×n matrix in every iteration. Results: This storage requirement became unrealistic when n … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 8,538 accessesView PDFCite