Carry-save-adderCSA is the most often used type of operation in implementing a fast computation of arithmetics of register-transfer level design in industry. This paper establis...
In this paper, we present a complete computational pipeline for extracting a compact shape descriptor for curve point cloud data. Our shape descriptor, called a barcode, is based ...
Anne D. Collins, Afra Zomorodian, Gunnar Carlsson,...
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduce...