2503 search results - page 333 / 501 » A study of 3-arc graphs |
157
click to vote
FOSSACS
2008
Springer
15 years 7 months ago
2008
Springer
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLC...
150
click to vote
IPCO
2010
15 years 7 months ago
2010
Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...
146
click to vote
APPML
2006
15 years 5 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
149
click to vote
DM
2006
15 years 5 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
148
click to vote
IJCV
2008
15 years 5 months ago
2008
In this paper, we study a perceptual scale space by constructing a so-called sketch pyramid which augments the Gaussian and Laplacian pyramid representations in traditional image ...