We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Several navigation situations can be imagined where visual cueing is not practical or unfeasible, and where the hands are required exclusively for a certain task. The utilization o...
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...