Sciweavers

2095 search results - page 387 / 419
» Improved pebbling bounds
Sort
View
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 6 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 6 months ago
Post-placement voltage island generation
High power consumption will shorten battery life for handheld devices and cause thermal and reliability problems. One way to lower the dynamic power consumption is to reduce the s...
Royce L. S. Ching, Evangeline F. Y. Young, Kevin C...
PEPM
2009
ACM
14 years 6 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
IUI
2009
ACM
14 years 6 months ago
Detecting and correcting user activity switches: algorithms and interfaces
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
Jianqiang Shen, Jed Irvine, Xinlong Bao, Michael G...
CCS
2010
ACM
14 years 4 months ago
Practical ID-based encryption for wireless sensor network
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity...
Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng...