One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Most programs are repetitive, where similar behavior can be seen at different execution times. Proposed on-line systems automatically group these similar intervals of execution in...
Encryption algorithms can be used to help secure wireless communications, but securing data also consumes resources. The goal of this research is to provide users or system develo...
Creighton T. R. Hager, Scott F. Midkiff, Jung Min ...
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...