SAGT
2010
Springer
14 years 4 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...
ESA
1994
Springer
14 years 10 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...
CVPR
2005
IEEE
15 years 8 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...