The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...