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...
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...
Hybrid generative-discriminative techniques and, in particular, generative score-space classification methods have proven to be valuable approaches in tackling difficult object or...
Alessandro Perina, Marco Cristani, Umberto Castell...
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...