|
|
|
|
|
Spyros Kontogiannis, Andreas Paraskevopoulos and Christos Zaroliagis
We consider the problem of computing a set of meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent alternative route ...
ver más
|
|
|
|
|
|
|
|
|
Derar Eleyan, Abed Othman and Amna Eleyan
Comments are used to explain the meaning of code and ease communications between programmers themselves, quality assurance auditors, and code reviewers. A tool has been developed to help programmers write readable comments and measure their readability l...
ver más
|
|
|
|
|
|
|
|
|
Yanjun Wu, Xinnian Wang and Tao Zhang
Given a query shoeprint image, shoeprint retrieval aims to retrieve the most similar shoeprints available from a large set of shoeprint images. Most of the existing approaches focus on designing single low-level features to highlight the most similar asp...
ver más
|
|
|
|
|
|
|
|
|
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl and Dorothea Wagner
Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road network...
ver más
|
|
|
|
|
|
|
|
|
Elias Dritsas, Andreas Kanavos, Maria Trigka, Spyros Sioutas and Athanasios Tsakalidis
The need to store massive volumes of spatio-temporal data has become a difficult task as GPS capabilities and wireless communication technologies have become prevalent to modern mobile devices. As a result, massive trajectory data are produced, incurring...
ver más
|
|
|
|