1279 search results - page 115 / 256 » Fast Implementations of Automata Computations |
147
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Carry-save-adder CSA 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...
185
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
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 ...
163
click to vote
DSN
2006
IEEE
15 years 10 months ago
2006
IEEE
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...
186
click to vote
PACT
2009
Springer
16 years 26 days ago
2009
Springer
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...
156
click to vote
DOCENG
2003
ACM
15 years 11 months ago
2003
ACM
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...