5608 search results - page 25 / 1122 » On the Theory of Matchgate Computations |
237
click to vote
AMC
2011
14 years 5 months ago
2011
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
151
click to vote
FOGA
2011
14 years 4 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
125
click to vote
TVCG
2012
13 years 3 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
ICIP
2009
IEEE
14 years 11 months ago
2009
IEEE
Great stride has been made in psychological research about primitives of visual perception, which is important to computer vision and image processing. In this paper, we propose a...
125
click to vote
SAGT
2010
Springer
14 years 11 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...