Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
— Next generation multimedia mobile phones that use the high bandwidth 3G cellular radio network consume more power. Multimedia algorithms such as speech, video transcodecs have ...
—Position of mobile users has become highly important information in pervasive computing environments. Indoor localization systems based on Wi-Fi signal strength fingerprinting t...
Aleksandar Matic, Andrei Papliatseyeu, Venet Osman...
: As cloud services grow to span more and more globally distributed datacenters, there is an increasingly urgent need for automated mechanisms to place application data across thes...
Sharad Agarwal, John Dunagan, Navendu Jain, Stefan...