This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05)
Simultaneous Column Minimization-Encoding Approach for Serial Decomposition
Las Vegas, Nevada
August 16-August 18
ISBN: 0-7695-2358-7
Shruti Patil, University of Nevada at Las Vegas
V. Muthukumar, University of Nevada at Las Vegas
In this paper we present an approach that combines the process of column encoding and input-output encoding. Traditionally, the process of column minimization is represented as a set covering or clique partitioning or graph coloring algorithms. These algorithms are well known NP-hard problems. The column minimization problem is followed by the input-output encoding problem which is represented as a weighted graph assignment problem which is again a well known NP-hard problem. The combined column minimization and input-output encoding algorithm reduces the complexity by representing both the above problems as a single weighted graph encoding problem. The proposed algorithm has been implemented and evaluated with standard benchmarks.
Citation:
Shruti Patil, V. Muthukumar, "Simultaneous Column Minimization-Encoding Approach for Serial Decomposition," iccima, pp.159-165, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.