Sciweavers

7776 search results - page 1427 / 1556
» Maintaining Maintainability
Sort
View
CASES
2005
ACM
15 years 8 months ago
Exploring the design space of LUT-based transparent accelerators
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
Sami Yehia, Nathan Clark, Scott A. Mahlke, Kriszti...
CF
2005
ACM
15 years 8 months ago
Controlling leakage power with the replacement policy in slumberous caches
As technology scales down at an exponential rate, leakage power is fast becoming the dominant component of the total power budget. A large share of the total leakage power is diss...
Nasir Mohyuddin, Rashed Bhatti, Michel Dubois
COMPGEOM
2005
ACM
15 years 8 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
DIM
2005
ACM
15 years 8 months ago
A delegation framework for federated identity management
Identity federation is a powerful scheme that links accounts of users maintained distinctly by different business partners. The concept of network identity is a driver for accele...
Hidehito Gomi, Makoto Hatakeyama, Shigeru Hosono, ...
« Prev « First page 1427 / 1556 Last » Next »