Sciweavers

2771 search results - page 85 / 555
» A General Computational Treatment of the Comparative
Sort
View
OPODIS
2003
14 years 11 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
DATE
2006
IEEE
171views Hardware» more  DATE 2006»
15 years 3 months ago
Dynamic bit-width adaptation in DCT: image quality versus computation energy trade-off
We present a dynamic bit-width adaptation scheme in DCT applications for efficient trade-off between image quality and computation energy. Based on sensitivity differences of 64 ...
Jongsun Park, Jung Hwan Choi, Kaushik Roy
SC
2009
ACM
15 years 2 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...
PEWASUN
2007
ACM
14 years 11 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
CORR
2007
Springer
173views Education» more  CORR 2007»
14 years 9 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge