The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
In a social news website people share content they found on the web, called news, then vote for those they like the most. Voting for a news is then considered as a recommendation,...
Thomas Largillier, Guillaume Peyronnet, Sylvain Pe...
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...