Nacionalni portal odprte znanosti

We consider the problem of ranking the vertices of an undirected graph given some preference relation. This ranking on graphs problem has been tackled before using spectral relaxations in [1]. Their approach is strongly related to the spectral relaxation made in spectral clustering algorithms. On ...

Structured prediction is the problem of predicting multiple outputs with complex internal structure and dependencies among them. Algorithms and models for predicting structured data have been in use for a long time. For example, recurrent neural networks and hidden Markov models have found interesti ...