For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
One of the greatest challenges in computational chemistry is the design of enzymes to catalyze non-natural chemical reactions. We focus on harnessing the distributed parallel comp...
Jianwu Wang, Prakashan Korambath, Seonah Kim, Scot...
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Multicast conferencing is a rapidly-growing area of Internet use. Audio, video and other media such as shared whiteboard data can be distributed efficiently between groups of confe...
Mourad Amad, Zahir Haddad, Lachemi Khenous, Kamal ...
The challenge for user authentication in a global file system is allowing people to grant access to specific users and groups in remote administrative domains, without assuming ...
Michael Kaminsky, George Savvides, David Mazi&egra...