Sciweavers

6045 search results - page 172 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
COR
2006
91views more  COR 2006»
13 years 8 months ago
An LP approach to compute the pre-kernel for cooperative games
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
Holger Meinhardt
UAI
2004
13 years 9 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
BMVC
2010
13 years 6 months ago
Recognition from Appearance Subspaces across Image Sets of Variable Scale
Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity ...
Ognjen Arandjelovic
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
14 years 1 months ago
A Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. Th...
Mirela Tanase, Remco C. Veltkamp
CSL
2005
Springer
14 years 1 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys