In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy som...
In petabyte-scale distributed file systems that decouple read and write from metadata operations, behavior of the metadata server cluster will be critical to overall system perfo...
Sage A. Weil, Kristal T. Pollack, Scott A. Brandt,...
Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient ...
Abstract--Searching large image databases is a time consuming process when done manually. Current CBIR methods mostly rely on training data in specific domains. When source and dom...
Mohammad Mehdi Saboorian, Mansour Jamzad, Hamid R....
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...