The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
The estimation of average-power dissipation of a circuit through exhaustive simulation is impractical due to the large number of primary inputs and their combinations. In this brie...
Ashok K. Murugavel, N. Ranganathan, Ramamurti Chan...