The notion of frequency computation concerns approxima-tive computations of n distinct parallel queries to a set A. A is called (m; n)-recursive if there is an algorithm which answers any n distinct parallel queries to A such that at least m answers are correct. This paper gives natural combinatorial characterizations of the fundamental inclusion problem, namely the question for which choices o...

The two-dimensional (2-D) maximum Tsallis entropy method often gets ideal segmentation results, because it not only takes advantage of the spatial neighbor information with using the 2-D histogram of the image, but also has some flexibility with a parameter. However, its time-consuming computation is often an obstacle in real time application systems. In this paper, a fast image thresholding me...

Interpretation of Recursive Queries Agostino Cortesi and Raju Halder 1 DAIS, Università Ca’ Foscari Venezia, Italy [email protected] 2 Dept. of Comp. Sc. & Engg., Indian Institute of Technology Patna, India Abstract. In this paper, we extend recent works on concrete and abstract semantics of structured query languages by considering recursive queries too. We show that combining abstraction of da...

Cyclic sharing (cyclic graph rewriting) has been used as a practical technique for implementing recursive computation eeciently. To capture its semantic nature, we introduce categorical models for lambda calculi with cyclic sharing (cyclic lambda graphs), using notions of computation by Moggi / Power and Robinson and traced monoidal categories by Joyal, Street and Verity. The former is used for...

In this paper, an efficient architecture is presented for displaying images in JPEG format in cell phones. The architecture mainly emphasizes on efficient computation of 2Dimensional Inverse Discrete Cosine Transform (2-D IDCT), which is the most computationally intensive part for JPEG image decoding. Pipelining/interleaving technique is employed in our recursive computing scheme to overcome th...

The problems of eecient computation of generalized Gabor transforms are considered in this work. Block time-recursive Gabor transforms are deened for both complex and real data sequences, fast algorithms are derived through two diierent approaches, one by the nite Zak transform, the other by biorthogonal functions. All the block time-recursive algorithms for the computation of generalized Ga-bo...

Power Spectral Density (PSD) computed by taking the Fourier transform of auto-correlation functions (WienerKhintchine Theorem) gives better result, in case of noisy data, as compared to the Periodogram approach. However, the computational complexity of Wiener-Khintchine approach is more than that of the Periodogram approach. For the computation of short time Fourier transform (STFT), this probl...