Sciweavers

828 search results - page 145 / 166
» Bounded Hairpin Completion
Sort
View
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 5 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...
WISEC
2009
ACM
14 years 3 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
INFOCOM
2008
IEEE
14 years 3 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...
INFOCOM
2008
IEEE
14 years 3 months ago
Index Policies for Real-Time Multicast Scheduling for Wireless Broadcast Systems
Abstract—Motivated by the increasing usage of wireless broadcast networks for multicast real-time applications like video, this paper considers a canonical real-time multicast sc...
Vivek Raghunathan, Vivek S. Borkar, Min Cao, P. R....
FOCS
2007
IEEE
14 years 3 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak