374 search results - page 42 / 75 » Stochastic Minority on Graphs |
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Due to the high performance of recent computer graphics hardware, 3D CG and CG animations have become in great demand for various applications. Many 3D models have already been cr...