Sciweavers

195 search results - page 9 / 39
» A fast algorithm for power grid design
Sort
View
GCC
2004
Springer
14 years 1 months ago
Distributed MD4 Password Hashing with Grid Computing Package BOINC
Distributed computing on heterogeneous nodes, or grid computing, provides a substantial increase in computational power available for many applications. This paper reports our expe...
Stephen Pellicer, Yi Pan, Minyi Guo
ECCV
2008
Springer
14 years 9 months ago
A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
Lei Wang, Luping Zhou, Chunhua Shen
DAC
2005
ACM
14 years 8 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
Murari Mani, Anirudh Devgan, Michael Orshansky
PC
2006
153views Management» more  PC 2006»
13 years 7 months ago
Algorithmic skeletons meeting grids
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...
Marco Danelutto, Marco Aldinucci
DCC
2000
IEEE
14 years 1 days ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel