Sciweavers

653 search results - page 82 / 131
» The size of minimum 3-trees
Sort
View
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 4 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
ISSS
1999
IEEE
131views Hardware» more  ISSS 1999»
15 years 4 months ago
Compressed Code Execution on DSP Architectures
Decreasing the program size has become an important goal in the design of embedded systems target to mass production. This problem has led to a number of efforts aimed at designin...
Paulo Centoducatte, Ricardo Pannain, Guido Araujo
IPPS
1998
IEEE
15 years 4 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
DAC
2010
ACM
15 years 3 months ago
Towards scalable system-level reliability analysis
State-of-the-art automatic reliability analyses as used in system-level design approaches mainly rely on Binary Decision Diagrams (BDDs) and, thus, face two serious problems: (1) ...
Michael Glaß, Martin Lukasiewycz, Christian ...
DEXA
2006
Springer
139views Database» more  DEXA 2006»
15 years 3 months ago
Distributed Continuous Range Query Processing on Moving Objects
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku