4679 search results - page 283 / 936 » The Timely Computing Base Model and Architecture |
200
click to vote
DAC
2007
ACM
15 years 10 months ago
2007
ACM
When designers create RTL models from a system-level specification, arrays in the system-level model are often implemented as memories in the RTL. Knowing the correspondence betwe...
183
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
207
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...
192
click to vote
MSWIM
2005
ACM
16 years 6 days ago
2005
ACM
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...
150
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
We suggest a new technique to reduce energy consumption in the processor datapath without sacrificing performance by exploiting operand value locality at run time. Data locality is...