Sciweavers

552 search results - page 99 / 111
» Reducing Time Complexity in RFID Systems
Sort
View
CASES
2003
ACM
14 years 1 months ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
CASES
2005
ACM
13 years 10 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...
EDCC
2008
Springer
13 years 9 months ago
A Distributed Approach to Autonomous Fault Treatment in Spread
This paper presents the design and implementation of the Distributed Autonomous Replication Management (DARM) framework built on top of the Spread group communication system. The ...
Hein Meling, Joakim L. Gilje
IPSN
2007
Springer
14 years 2 months ago
MeshEye: a hybrid-resolution smart camera mote for applications in distributed intelligent surveillance
Surveillance is one of the promising applications to which smart camera motes forming a vision-enabled network can add increasing levels of intelligence. We see a high degree of i...
Stephan Hengstler, Daniel Prashanth, Sufen Fong, H...
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 8 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren