114
Voted
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
114
click to vote
ESA
1994
Springer
15 years 3 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
107
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a novel representation and method for detecting and explaining anomalous activities in a video stream. Drawing from natural language processing, we introduce a represen...