2168 search results - page 333 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
137
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
146
click to vote
DAC
2007
ACM
15 years 7 months ago
2007
ACM
Mixed Vt has been widely used to control leakage without affecting circuit performance. However, current approaches target the combinational circuits even though sequential elemen...
149
click to vote
PPOPP
2011
ACM
14 years 6 months ago
2011
ACM
Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race condit...
148
click to vote
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
Global illumination provides a visual richness not achievable with the direct illumination models used by most interactive applications. To generate global effects, numerous appro...
147
click to vote
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...