2168 search results - page 154 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
216
click to vote
FOCS
2005
IEEE
16 years 8 hour ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
166
click to vote
PSLS
1995
15 years 10 months ago
1995
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
170
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
163
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper a novel implementation of the saliency map model on a multi-GPU platform using CUDA technology is presented. The saliency map model is a wellknown computational m...
196
click to vote
FPGA
2001
ACM
15 years 11 months ago
2001
ACM
Discrete wavelet transformations (DWT) followed by embedded zerotree encoding is a very efficient technique for image compression [2, 5, 4]. However, the algorithms proposed in l...