An important aspect of exploratory search over graph data is to understand what paths connect a given pair of nodes. Since the resulting paths can be manifold, various works propose ranking paths likely to be of interest ...

In this paper we consider a game theory approach for representing a real-world attacker–defender Stackelberg security game. In this novel approach the behavior of an ergodic system (repeated stochastic Markov chain game) ...

Aiming to identify plants, we propose to evaluate the color texture of the palisade parenchyma, from microscopic images of leaf cross-sections, using a graph based approach. Our texture analysis approach models the image ...

In recent years, spatial load forecasting studies have helped to direct the expansion of the distribution systems in cities with rapid urban growth, providing maps that showing the spatial distribution of expected load. ...

Over the last years, the interest in preserving digitally ancient documents has increased resulting in databases with a huge amount of image data. Most of these documents are not transcribed and thus querying operations ...

This dissertation introduces the Restricted Robust Shortest Path problem (R-RSP), a robust optimization version of the Restricted Shortest Path problem (R-SP), a classical NP-hard problem. Given a digraph G, we associate ...

"Una ruta más corta restringida es una secuencia de arcos de costo mínimo en una red dirigida que satisface las restricciones de tipo knapsack en el consumo de recursos sobre los arcos. Nosotros proponemos un método exacto ...