2157 search results - page 105 / 432 » Optimal Fast Hashing |
130
Voted
DAC
2003
ACM
16 years 5 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
146
click to vote
WCRE
2002
IEEE
15 years 9 months ago
2002
IEEE
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
136
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The dense wavelength division multiplexing (DWDM) technique has been developed to provide a tremendous number of wavelengths/channels in an optical fiber. In the multi-c...
143
click to vote
TIP
1998
15 years 4 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
193
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...