In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...