Sciweavers

344 search results - page 53 / 69
» Banach-Mazur Games on Graphs
Sort
View
PAMI
2007
113views more  PAMI 2007»
13 years 8 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
TCS
2010
13 years 7 months ago
Cops and Robbers from a distance
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
CSL
2006
Springer
14 years 11 days ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 8 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
CVPR
2006
IEEE
14 years 10 months ago
Multi-Target Tracking - Linking Identities using Bayesian Network Inference
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
Peter Nillius, Josephine Sullivan, Stefan Carlsson